Loading...

Recasting constraint automata into Büchi automata

Izadi, M ; Sharif University of Technology | 2008

288 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-85762-4_11
  3. Publisher: 2008
  4. Abstract:
  5. Constraint automata have been proposed as the operational semantics of Reo, a glue-code language for the exogenous composition and orchestration of components in a software system. In this paper we recast the theory of constraint automata into that of Büchi automata on infinite strings of records. We use records to express simultaneity constraints of I/O operations and show that every constraint automaton can be expressed as a Büchi automaton on an appropriate alphabet of records. Further, we give examples of component compositions that are expressible as Büchi automata but not as constraint automata. Finally, we show that the join composition operator for constraint automata and its counterpart for Büchi automata of records can be expressed as two basic operations on Büchi automata: alphabet extension and product. © Springer-Verlag Berlin Heidelberg 2008
  6. Keywords:
  7. Chemical analysis ; Computer software ; Constraint theory ; Finite automata ; Information theory ; Robots ; Translation (languages) ; Composition operators ; Constraint automaton ; Glue-code language ; I/O operations ; Infinite strings ; Operational semantics ; Software systems ; Automata theory
  8. Source: 5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008, Istanbul, 1 September 2008 through 3 September 2008 ; Volume 5160 LNCS , 2008 , Pages 156-170 ; 03029743 (ISSN) ; 3540857613 (ISBN); 9783540857617 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-540-85762-4_11