Decomposing port automata

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 1369-1373

  Koehler, Christian ^a   Clarke, Dave ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPONENT CONNECTORS; COORDINATION LANGUAGE; DECOMPOSITION THEOREMS; OPERATIONAL MODEL;

COMPUTER SCIENCE; DECOMPOSITION; DOMAIN DECOMPOSITION METHODS; ROBOTS; TRANSLATION (LANGUAGES);

PORTS AND HARBORS;

EID: 72949096992     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529587     Document Type: Conference Paper

References (9)

1. F. Arbab. Reo: a Channel-based Coordination Model for Component Composition. Mathematical Structures in Computer Science, 14:329-366, 2004.
2. F. Arbab, C. Baier, F. S. de Boer, J. J. M. M. Rutten, and M. Sirjani. Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications. In COORDINATION 2005, volume 3454 of Lecture Notes in Computer Science, pages 236-251. Springer, 2005.
3. F. Arbab, C. Baier, J. Rutten, and M. Sirjani. Modeling Component Connectors in Reo by Constraint Automata. Science of Computer Programming, 61:75-113, 2006.
4. R. Bruni, I. Lanese, and U. Montanari. A basic Algebra of Stateless Connectors. Theoretical Computer Science, 366(1):98-120, 2006.
5. D. Clarke, D. Costa, and F. Arbab. Connector Colouring I: Synchronisation and Context Dependency. Science of Computer Programming, 66(3):205-22, 2007.
6. D. Gelernter and N. Carriero. Coordination Languages and their Significance. Commun. ACM, 35(2):97-107, 1992.
7. K. Krohn and J. Rhodes. Algebraic Theory of Machines I: Prime Decomposition Theorems for Finite Semigroups and Machines. Transactions of the American Mathematical Society, 116:450-464, 1965.
8. R. Milner. Calculi for Synchrony and Asynchrony. Theoretical Computer Science, 25:267-310, 1983.
9. R. Milner. Communication and Concurrency. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1989.