论文信息 - Decomposing port automata

Decomposing port automata

Port automata are an operational model for component connectors in a coordination language such as Reo. They describe which sets of ports can synchronize in each state of the connector being modelled. This paper presents decomposition theorems for port automata, namely that all (finite) port automata can be generated from a small set of primitive port automata. Applying these results to component connectors means that all component connectors can be constructed from just two primitive connectors.

Dave Clarke | Christian Krause | D. Clarke | Christian Krause

[1] Farhad Arbab,et al. Connector Colouring I: Synchronisation and Context Dependency , 2006, Electron. Notes Theor. Comput. Sci..

[2] Christel Baier,et al. Modeling component connectors in Reo by constraint automata , 2004, Sci. Comput. Program..

[3] Farhad Arbab,et al. Reo: A Channel-based Coordination Model for Component Composition , 2005 .

[4] Robin Milner,et al. Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[5] Christel Baier,et al. Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications , 2005, COORDINATION.

[6] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[7] Roberto Bruni,et al. A basic algebra of stateless connectors , 2006, Theor. Comput. Sci..

[8] Nicholas Carriero,et al. Coordination languages and their significance , 1992, CACM.

[9] J. Rhodes,et al. Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines , 1965 .