Loading...

Automata based model checking for reo connectors

Bonsangue, M. M ; Sharif University of Technology

475 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-642-11623-0_15
  3. Abstract:
  4. Reo is a connector language for the exogenous composition and orchestration of components in a software system. An operational semantics of Reo connectors can be given in terms of Büchi automata over a suitable alphabet of records, capturing both synchronization and context dependency requirements. In this paper, we define an action based linear time temporal logic for expressing properties of Reo connectors. Formulas can be synthesized into Büchi automata representing Reo connectors, thus leading to an automata based model checking algorithm. By generalizing standard automata based model checking algorithms for linear time temporal logic, we give an efficient on-the-fly algorithm for the model checking of formulas for Reo connectors
  5. Keywords:
  6. Automata-based model ; Context dependency ; Linear time temporal logic ; On-the-fly algorithms ; Operational semantics ; Software systems ; Computer software ; Mathematical models ; Permanent magnets ; Robots ; Temporal logic ; Translation (languages) ; Model checking
  7. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 15 April 2009 through 17 April 2009 ; Volume 5961 LNCS , 2010 , Pages 260-275 ; 03029743 (ISSN) ; 3642116221 (ISBN)
  8. URL: http://link.springer.com/chapter/10.1007/978-3-642-11623-0_15