A Büchi automata based model checking framework for reo connectors

Reo is an exogenous coordination language for synchronizing components participating in a component-based system. In this paper we provide a verification framework for model checking of Reo connectors. The proposed framework applies an extension of Büchi automata as the operational semantic model for Reo connectors and a record-based extension of linear time temporal logic (LTL) for expressing properties. Several aspects of Reo connectors, specially synchronization, context dependencies and fairness constraints, are addressed by this model checker due to its supported underlying model. The main ideas behind this implementation are to introduce a symbolic representation for the main elements of our model checking framework, adapt some existing theories to our verification context and develop a new BDD-based model checker with efficient performance. Moreover, all above mentioned features of Reo connectors are addressed by this toolkit. This implementation is evaluated by means of some case studies and the results are reported.

[1]  Marcello M. Bonsangue,et al.  Automata Based Model Checking for Reo Connectors , 2009, FSEN.

[2]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

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

[4]  Marcello M. Bonsangue,et al.  Büchi automata for modeling component connectors , 2011, Software & Systems Modeling.

[5]  Farhad Arbab,et al.  A Coinductive Calculus of Component Connectors , 2002, WADT.

[6]  Robert K. Brayton,et al.  Efficient omega-Regular Language Containment , 1992, CAV.

[7]  Kavita Ravi,et al.  A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles , 2000, FMCAD.

[8]  Roberto Bruni,et al.  Recent Trends in Algebraic Development Techniques , 2002, Lecture Notes in Computer Science.

[9]  Christel Baier,et al.  Principles of model checking , 2008 .

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

[11]  Stephan Merz,et al.  Model Checking , 2000 .

[12]  Farhad Arbab,et al.  Connector colouring I: Synchronisation and context dependency , 2006, Sci. Comput. Program..

[13]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[14]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[15]  Marcello M. Bonsangue,et al.  Modeling Component Connectors: Synchronisation and Context-Dependency , 2008, 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods.

[16]  Christel Baier,et al.  Models and temporal logical specifications for timed component connectors , 2007, Software & Systems Modeling.