Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
Confluence for process verification
Theoretical Computer Science
Concurrency: state models & Java programs
Concurrency: state models & Java programs
Selective mu-calculus and formula-based equivalence of transition systems
Journal of Computer and System Sciences
Modal and temporal properties of processes
Modal and temporal properties of processes
Communication and Concurrency
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
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)
Safety for Branching Time Semantics
ICALP '91 Proceedings of the 18th 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
Partial-Order Reduction in the Weak Modal Mu-Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool
FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
"On the Fly" Verification of Behavioural Equivalences and Preorders
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
A generic on-the-fly solver for alternation-free boolean equation systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
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
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Adaptation of Service Protocols Using Process Algebra and On-the-Fly Reduction Techniques
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Property-dependent reductions for the modal Mu-calculus
Proceedings of the 18th international SPIN conference on Model checking software
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
Distributed on-the-fly model checking and test case generation
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Sequential and distributed on-the-fly computation of weak tau-confluence
Science of Computer Programming
Partial model checking using networks of labelled transition systems and boolean equation systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
On-the-fly verification of concurrent finite-state systems consists in constructing and analysing their underlying state spaces in a demand-driven way. This technique is able to detect errors effectively in large systems; however, its performance can still be increased by reducing the state spaces incrementally in a way compatible with the verification problem. In this paper, we propose algorithms for three on-the-fly reductions of Labeled Transition Systems (LTSs), which preserve weak equivalence relations: Τ-compression (collapsing of strongly connected components made of Τ-transitions), Τ-closure (transitive reflexive closure over Τ-transitions), and Τ-confluence (a form of partial order reduction). Each algorithm is described as a reductor module taking as input the successor function of an LTS and returning the successor function of the reduced LTS. The three reductors were implemented within the CADP toolbox using the generic OPEN/CÆSAR environment, which makes them directly available for any on-the-fly verification tool connected to OPEN/CÆSAR and compatible with the underlying reduction. Our experiments show that these reductors can improve significantly the performance of on-the-fly LTS generation, model checking, and equivalence checking.