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
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
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)
Connector colouring I: Synchronisation and context dependency
Science of Computer Programming
Symbolic Model Checking for Channel-based Component Connectors
Electronic Notes in Theoretical Computer Science (ENTCS)
Recasting Constraint Automata into Büchi Automata
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Modeling Component Connectors: Synchronisation and Context-Dependency
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Reasoning About Connector Reconfiguration II: Basic Reconfiguration Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Regular expressions and the equivalence of programs
Journal of Computer and System Sciences
GOAL: a graphical tool for manipulating Büchi automata and temporal formulae
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Verification of context-dependent channel-based service models
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Formal modeling
A Büchi automata based model checking framework for reo connectors
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
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.