A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Enhancing compositional reachability analysis with context constraints
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Forward and backward simulations I.: untimed systems
Information and Computation
Checking subsystem safety properties in compositional reachability analysis
Proceedings of the 18th international conference on Software engineering
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Context constraints for compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Model checking
Communication and Concurrency
Compositionality in State Space Verification Methods
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Merging State-Based and Action-Based Verification
ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
Hi-index | 0.00 |
Labelled state transition system (LSTS) is a formalism intended to combine the benefits of both state-based and action-based models. However, its existent equivalence preserves many properties with the cost of poor reduction effects. A new equivalence is presented, namely called reverse observation equivalence which is defined in the opposite direction to observation equivalence and orients the invariant checking of LSTS. Experiments show that the new semantics is efficient in the context of compositional reachability analysis.