Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Model checking
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Symbolic Model Checking
Logic Synthesis and Verification Algorithms
Logic Synthesis and Verification Algorithms
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
Construction of negotiation protocols for e-commerce applications
ACM SIGecom Exchanges
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)
Formal Methods for Components and Objects: Second International Symposium, FMCO 2003, Leiden, The Netherlands, November 4-7, 2003. Revised Lectures (Lecture Notes in Computer Science)
Reasoning About Connector Reconfiguration II: Basic Reconfiguration Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling coordination in biological systems
ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
Reo Connectors as Coordination Artifacts in 2APL Systems
PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
Modeling and analysis of Reo connectors using alloy
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Alternating-time stream logic for multi-agent systems
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Comparing three coordination models: Reo, ARC, and PBRD
Science of Computer Programming
Modeling dynamic reconfigurations in Reo using high-level replacement systems
Science of Computer Programming
Formal modeling
Automata based model checking for reo connectors
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Symbolic execution of Reo circuits using constraint automata
Science of Computer Programming
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
| Hi-index | 0.00 |
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specification formalisms is a branching time logic that allows to reason about the coordination principles of and the data flow in the network. The underlying model checking algorithm relies on variants of standard automata-based approaches and model checking for CTL-like logics. The implementation uses a symbolic representation of the network and the enabled I/O-operations by means of binary decision diagrams. It has been applied to a couple examples that illustrate the efficiency of our model checker.