Proceedings of the Fourth Annual Symposium on Logic in computer science
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking
Component Software: Beyond Object-Oriented Programming
Component Software: Beyond Object-Oriented Programming
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm
Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
Verification for Robust Specification
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Compositional Minimization of Finite State Systems
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Compositional Failure-based Equivalence of Constraint Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Constraint automaton is a formalism to capture the operational semantics of the channel based coordination language Reo. In general constraint automaton can be used as a formalism for modeling coordination of some components. In this paper we introduce a standard linear temporal logic and two fragments of it for expressing the properties of the systems modeled by constraint automata and show that the equivalence relation defined by Valmari et al. is the minimal compositional equivalence preserving that fragment of linear time temporal logic which has no next-time operator and has an extra operator distinguishing deadlocks and a slight modification of this equivalence is the minimal equivalence preserving linear time temporal logic without next-time operator. We present a compositional model checking method based on these equivalences for component-based systems modeled by labeled transition systems and constraint automata and a simplification of it for model checking the coordinating subsystems modeled by constraint automata.