A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
A linear algorithm to solve fixed-point equations on transition systems
Information Processing Letters
On-line algorithms for polynomially solvable satisfiability problems
Journal of Logic Programming
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Model checking and boolean graphs
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Characteristic formulae for processes with divergence
Information and Computation
Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
Communication and Concurrency
Handbook of Process Algebra
Bisimulation Minimization and Symbolic Model Checking
Formal Methods in System Design
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
Verifying Bisimulations "On the Fly"
FORTE '90 Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, III
Computing Behavioural Relations, Logically
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Safety for Branching Time Semantics
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Efficient Diagnostic Generation for Boolean Equation Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Tool Set for deciding Behavioral Equivalences
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Efficient Local Correctness Checking
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Efficient Checking of Behavioural Relations and Modal Assertions using Fixed-Point Inversion
Proceedings of the 7th International Conference on Computer Aided Verification
HORNSAT, Model Checking, Verification and games (Extended Abstract)
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
On-the-fly state space reductions for weak equivalences
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
BISIMULATOR: a modular tool for on-the-fly equivalence checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Sequential and distributed on-the-fly computation of weak tau-confluence
Science of Computer Programming
| Hi-index | 0.00 |
Equivalence checking is a classical verification method for ensuring the compatibility of a finite-state concurrent system (protocol) with its desired external behaviour (service) by comparing their underlying labeled transition systems (Ltss) modulo an appropriate equivalence relation. The local (or on-the-fly) approach for equivalence checking combats state explosion by exploring the synchronous product of the Ltss incrementally, thus allowing an efficient detection of errors in complex systems. However, when the two Ltss being compared are equivalent, the on-the-fly approach is outperformed by the global one, which completely builds the Ltss and computes the equivalence classes between states using partition refinement. In this paper, we consider the approach based on translating the on-the-fly equivalence checking problem in terms of the local resolution of a boolean equation system (Bes). We propose two enhancements of the approach in the case of equivalent Ltss: a new, faster encoding of equivalence relations in terms of Bess, and a new local Besresolution algorithm with a better average complexity. These enhancements were incorporated into the Bisimulator2.0 equivalence checker of the Cadptoolbox, and they led to significant performance improvements w.r.t. existing on-the-fly equivalence checking algorithms.