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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Pourvatan, B., Sirjani, M., Arbab, F., & Bonsangue, M. M. (2012). Decomposition of constraint automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6921 LNCS, pp. 237–258). https://doi.org/10.1007/978-3-642-27269-1_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
