Decomposition of constraint automata

Authors:
Bahman Pourvatan;Marjan Sirjani;Farhad Arbab;Marcello M. Bonsangue
Affiliations:
AmirKabir University, Tehran, Iran;Reykjavik University, Reykjavik, Iceland;CWI, Amsterdam, Netherland;CWI, Amsterdam, Netherland
Venue:
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Year:
2010

Citing 9
Cited 1

On Kleene algebras and closed semirings

MFCS '90 Proceedings on Mathematical foundations of computer science 1990
Automata, Languages, and Machines

Automata, Languages, and Machines
Reo: a channel-based coordination model for component composition

Mathematical Structures in Computer Science
Modeling Behavior in Compositions of Software Architectural Primitives

Proceedings of the 19th IEEE international conference on Automated software engineering
Web services choreography and orchestration in Reo and constraint automata

Proceedings of the 2007 ACM symposium on Applied computing
Decomposing port automata

Proceedings of the 2009 ACM symposium on Applied Computing
Compact Normal Form for Regular Languages as Xor Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Synthesis of reo circuits for implementation of component-connector automata specifications

COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Algebraic hierarchical decomposition of finite state automata: comparison of implementations for krohn-rhodes theory

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Encoding context-sensitivity in Reo into non-context-sensitive semantic models

COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reo is a coordination language that can be used to model different systems. Constraint automata form a formal semantics for Reo connectors based on a co-algebraic model of streams. In this paper, we introduce complete constraint automata (CCA ) whose extra information about entropy states helps in analyzing and decomposing them into Reo circuits. We show that a complete constraint automaton is invertible. This property helps to partition and decompose a constraint automaton, a process which can be utilized to synthesize Reo circuits from constraint automata, automatically.