Recasting Constraint Automata into Büchi Automata

Authors:
Mohammad Izadi;Marcello M. Bonsangue
Affiliations:
LIACS - Leiden University, The Netherlands and Dept. of Computer Engineering, Sharif University of Technology, Tehran, Iran and Research Institute for Humanities and Cultural Studies, , Tehran, Ir ...;LIACS - Leiden University, The Netherlands and Centrum voor Wiskunde en Informatica (CWI), The Netherlands
Venue:
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Year:
2008

Citing 15
Cited 4

Computer architecture and organization; (2nd ed.)

Computer architecture and organization; (2nd ed.)
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking

Model checking
Component Software: Beyond Object-Oriented Programming

Component Software: Beyond Object-Oriented Programming
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Verification of Fair Transisiton Systems

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Reo: a channel-based coordination model for component composition

Mathematical Structures in Computer Science
Models and Temporal Logics for Timed Component Connectors

SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Modeling component connectors in Reo by constraint automata

Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Component connectors with QoS guarantees

COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Synthesis of reo circuits for implementation of component-connector automata specifications

COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Stochastic reasoning about channel-based component connectors

COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages

Automata for Context-Dependent Connectors

COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Büchi automata for modeling component connectors

Software and Systems Modeling (SoSyM)
Automata based model checking for reo connectors

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A model of context-dependent component connectors

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.