Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Confluence for process verification
Theoretical Computer Science
Proceedings of the DIMACS workshop on Partial order methods in verification
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Stubborn set methods for process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Partial order reduction: linear and branching temporal logics and process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Weak confluence and &tgr;-inertness
Theoretical Computer Science
Formal verification of replication on a distributed data space architecture
Proceedings of the 2002 ACM symposium on Applied computing
An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation
Formal Methods in System Design
State Space Reduction Using Partial tau-Confluence
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
``Next'' Heuristic for On-the-Fly Model Checking
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
µCRL: A Toolset for Analysing Algebraic Specifications
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Prover for the muCRL toolset with applications -- version 0.1
A Prover for the muCRL toolset with applications -- version 0.1
Partial $\tau$-confluence for efficient state space generation
Partial $\'tau$-confluence for efficient state space generation
Equational binary decision diagrams
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
On-the-fly state space reductions for weak equivalences
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
Compositional State Space Reduction Using Untangled Actions
Electronic Notes in Theoretical Computer Science (ENTCS)
A capability calculus for concurrency and determinism
ACM Transactions on Programming Languages and Systems (TOPLAS)
State Space Reduction of Linear Processes Using Control Flow Reconstruction
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Partial Order Reductions Using Compositional Confluence Detection
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Analysing the BKE-security Protocol with μCRL
Electronic Notes in Theoretical Computer Science (ENTCS)
Obtaining Memory-Efficient Solutions to Boolean Equation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Model classifications and automated verification
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Confluence reduction for probabilistic systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
On-the-Fly branching bisimulation minimization for compositional analysis
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
A BDD-Representation for the logic of equality and uninterpreted functions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A capability calculus for concurrency and determinism
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
State space reduction of rewrite theories using invisible transitions
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Stochastic restricted broadcast process theory
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Sequential and distributed on-the-fly computation of weak tau-confluence
Science of Computer Programming
A cure for stuttering parity games
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Error-preserving local transformations on communication protocols
Software Testing, Verification & Reliability
Confluence reduction for markov automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
We present a modular method for on-the-fly state space reduction. The theoretical foundation of the method is a new confluence notion for labeled transition systems. The method works by adding confluence information to the symbolic representation of the state space. We present algorithms for on-the-fly exploration of the reduced state space, for detection of confluence properties and for a symbolic reduction, called prioritization. The latter two algorithms rely on an automated theorem prover to derive the necessary information. We also present some case studies in which tools that implement these algorithms were used.