Algebra of parameterised graphs

ACM Transactions on Embedded Computing Systems

Volumn 13, Issue 4s, 2014, Pages

  Mokhov, Andrey ^a   Khomenko, Victor ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Conditional partial order graphs; Design; G.2.2 discrete mathematics : graph theory; Instruction set architecture; Microelectronics; Parameterised graphs; Switching networks; Synthesis; Theory; Transistor networks

Indexed keywords

ALGEBRA; COMPUTER ARCHITECTURE; DESIGN; GRAPH THEORY; MICROELECTRONICS; PARAMETERIZATION; SPECIFICATIONS; SWITCHING NETWORKS; SYNTHESIS (CHEMICAL); TREES (MATHEMATICS);

G.2.2 [DISCRETE MATHEMATICS]: GRAPH THEORIES; INSTRUCTION SET ARCHITECTURE; PARAMETERISED GRAPHS; PARTIAL ORDER; THEORY; ALGEBRAIC EXPRESSION; CASE-STUDIES; EQUIVALENCE RELATIONS; GENERAL GRAPH; HARDWARE SYSTEM; OPERATIONAL MODES; SYSTEM CONFIGURATIONS;

GRAPHIC METHODS;

EID: 84995578224     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/2627351     Document Type: Conference Paper

References (21)

1. M. Bauderon and B. Courcelle. 1987. Graph expressions and graph rewritings. Math. Syst. Theory 20, 1 (1987), 83-127.
2. E. Best, R. Devillers, and M. Koutny. 2001. Petri Net Algebra. Monographs in Theoretical Computer Science, Springer.
3. A. Bizjak and A. Bauer. 2011. ALG User Manual. http:// hg.andrej.com/alg/.
4. B. A. Carré. 1971. An algebra for network routing problems. IMA J. Appl. Math. 7, 3 (1971), 273-294.
5. C. D'Alessandro, D. Shang, A. Bystrov, A. Yakovlev, and O. Maevsky. 2006. Multiple-rail phase-encoding for NoC. In Proceedings of the International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC). 107-116.
6. G. de Micheli. 1994. Synthesis and Optimization of Digital Circuits. McGraw-Hill Higher Education.
7. D. Eppstein. 1992. Parallel recognition of series-parallel graphs. Inform. Computat. 98, 1 (1992), 41-55.
8. F. Gadducci and R. Heckel. 1998. An inductive view of graph transformation. In Recent Trends in Algebraic Development Techniques. Lecture Notes in Computer Science, vol. 137, Springer, 223-237.
9. F. Gécseg. 1974. Composition of automata. In Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 14, Springer, 351-363.
10. C. A. R. Hoare. 1978. Communicating sequential processes. Commun. ACM 21, 8 (1978), 666-677.
11. ITRS. 2011. International Technology Roadmap for Semiconductors: Design. http://www.itrs.net/Links/2011ITRS/2011Chapters/2011Design.pdf.
12. M. B. Josephs and J. T. Udding. 1993. An overview of DI algebra. In Proceedings of the 26th Hawaii International Conference on System Sciences. Vol. 1, 329-338.
13. R. McConnell and F. de Montgolfier. 2005. Linear-time modular decomposition of directed graphs. Discrete Appl. Math. 145, 2 (2005), 198-209.
14. R. Milner. 1982. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92, Springer.
15. R. Milner, J. Parrow, and D. Walker. 1992. A calculus of mobile processes, Part I. Inform. Comput. 100, 1 (1992), 1-40.
16. A. Mokhov. 2012. An algebra of switching networks. Technical Report NCL-EEE-MSD-TR-2012-178. Newcastle University.
17. A. Mokhov, A. Alekseyev, and A. Yakovlev. 2011a. Encoding of processor instruction sets with explicit concurrency control. IET Comput. Digital Techniques 5, 6 (2011), 427-439.
18. A. Mokhov, V. Khomenko, A. Alekseyev, and A. Yakovlev. 2011b. Algebra of parametrised graphs. Technical Report CS-TR-1307. School of Computing Science, Newcastle University. http://www.cs.ncl.ac.uk/publications/trs/papers/1307.pdf.
19. A. Mokhov and A. Yakovlev. 2010. Conditional partial order graphs: Model, synthesis and application. IEEE Trans. Comput. 59, 11 (2010), 1480-1493.
20. C. E. Shannon. 1938. A symbolic analysis of relay and switching circuits. Trans. Amer. Institute Electr. Eng. 57 (1938), 713-723.
21. Texas Instruments. 2013. MSP430x4xx Family User's Guide. http://www.ti.com/lit/ug/slau056l/slau056l.pdf.