A linear algorithm to solve fixed-point equations on transition systems
Information Processing Letters
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
Confluence for process verification
Theoretical Computer Science
Distributed and structured analysis approaches to study large and complex systems
Lectures on formal methods and performance analysis
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)
State Space Reduction Using Partial tau-Confluence
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems
ICALP '94 Proceedings of the 21st 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
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Parallelizing the Murphi Verifier
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Partial $\tau$-confluence for efficient state space generation
Partial $\'tau$-confluence for efficient state space generation
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
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
DISTRIBUTOR and BCG_MERGE: tools for distributed explicit state space generation
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Property-dependent reductions for the modal Mu-calculus
Proceedings of the 18th international SPIN conference on Model checking software
Hi-index | 0.00 |
The notion of @t-confluence provides a form of partial order reduction of Labelled Transition Systems (Ltss), by enabling to identify the @t-transitions, whose execution does not alter the observable behaviour of the system. Several forms of @t-confluence adequate with branching bisimulation were studied in the literature, ranging from strong to weak forms according to the length of @t-transition sequences considered. Weak @t-confluence is more complex to compute than strong @t-confluence, but provides better Lts reductions. In this paper, we aim at devising an efficient detection of weak @t-confluent transitions during an on-the-fly exploration of Ltss. With this purpose, we define and prove new encodings of several weak @t-confluence variants using alternation-free Boolean equation systems (Bess), and we apply efficient local Bes resolution algorithms to perform the detection. The resulting reduction module, developed within the Cadp toolbox using the generic Open/Caesar environment for Lts exploration, was tested in both a sequential and a distributed setting on numerous examples of large Ltss underpinning communication protocols and distributed systems. These experiments assessed the efficiency of the reduction and enabled us to identify the best variants of weak @t-confluence that are useful in practice.