Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. D'Alessandro, A. Mokhov, A. Bystrov, A. Yakovlev (2007)
Delay/Phase Regeneration Circuits13th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'07)
G. Micheli (1994)
Synthesis and Optimization of Digital Circuits
R. McConnell, F. Montgolfier (2005)
Linear-time modular decomposition of directed graphsDiscret. Appl. Math., 145
M. Josephs, J. Udding (1993)
An overview of D-I algebra[1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences, i
Article 143, Publication date: July 2014 (pre-print)
(2011)
International Technology Roadmap for Semiconductors: Design. http://www.itrs.net/Links
D. Eppstein (1992)
Parallel Recognition of Series-Parallel GraphsInf. Comput., 98
Fei Xia, A. Mokhov, Yu Zhou, Yifan Chen, I. Mitrani, D. Shang, D. Sokolov, A. Yakovlev (2012)
Towards power-elastic systems through concurrency managementIET Comput. Digit. Tech., 6
A. Mokhov, M. Rykunov, D. Sokolov, A. Yakovlev (2014)
Design of Processors with Reconfigurable MicroarchitectureJournal of Low Power Electronics and Applications, 4
Rahim Ramezanian (1978)
Communicating sequential processesCommun. ACM, 21
Michel Bauderon, B. Courcelle (1987)
Graph expressions and graph rewritingsMathematical systems theory, 20
A. Mokhov, A. Alekseyev, A. Yakovlev (2011)
Encoding of processor instruction sets with explicit concurrency controlIET Comput. Digit. Tech., 5
(2011)
ALG User Manual
C. D'Alessandro, D. Shang, A. Bystrov, A. Yakovlev, O. Maevsky (2006)
Multiple-rail phase-encoding for NoC12th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'06)
D. Walker (1989)
A Calculus of Mobile Processes, Part I
J. Drobnak (2012)
Faculty of Mathematics and Physics
A. Mokhov, Khomenko, A. Alekseyev, A. Yakovlev (2011)
Algebra of Parametrised Graphs
C. Shannon (2021)
A symbolic analysis of relay and switching circuitsElectrical Engineering, 57
E. Best, Raymond Devillers, M. Koutny (2001)
Petri Net Algebra
B. Carré (1971)
An Algebra for Network Routing ProblemsIma Journal of Applied Mathematics, 7
R. Milner, J. Parrow, D. Walker (1992)
A Calculus of Mobile Processes, IIInf. Comput., 100
C. Shannon (1938)
A symbolic analysis of relay and switching circuitsTransactions of the American Institute of Electrical Engineers, 57
F. Gécseg (1974)
Composition of Automata
F. Gadducci, R. Heckel (1997)
An inductive view of graph transformation
C. Koomen (1991)
Calculus of Communicating Systems
A. Mokhov, A. Yakovlev (2010)
Conditional Partial Order Graphs: Model, Synthesis, and ApplicationIEEE Transactions on Computers, 59
Algebra of Parameterised Graphs ANDREY MOKHOV and VICTOR KHOMENKO, Newcastle University One of the difficulties in designing modern hardware systems is the necessity for comprehending and dealing with a very large number of system configurations, operational modes, and behavioural scenarios. It is often infeasible to consider and specify each individual mode explicitly, and one needs methodologies and tools to exploit similarities between the individual modes and work with groups of modes rather than individual ones. The modes and groups of modes have to be managed in a compositional way: the specification of the system should be composed from specifications of its blocks. This includes both structural and behavioural composition. Furthermore, one should be able to transform and optimise the specifications in a formal way. In this article, we propose a new formalism, called parameterised graphs. It extends the existing conditional partial order graphs (CPOGs) formalism in several ways. First, it deals with general graphs rather than just partial orders. Moreover, it is fully compositional. To achieve this, we introduce an algebra of parameterised graphs by specifying the equivalence relation by a set of axioms, which is proved to be sound, minimal, and complete. This allows one to manipulate
ACM Transactions on Embedded Computing Systems (TECS) – Association for Computing Machinery
Published: Jul 1, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.