An improved algorithm for transitive closure on acyclic digraphs
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Three partition refinement algorithms
SIAM Journal on Computing
Communication and Concurrency
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
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
µCRL: A Toolset for Analysing Algebraic Specifications
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A theory of normed simulations
ACM Transactions on Computational Logic (TOCL)
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
Compositional Performability Evaluation for STATEMATE
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Proceedings of the conference on Design, automation and test in Europe
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference 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
A compositional semantics for dynamic fault trees in terms of interactive Markov chains
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Refined interfaces for compositional verification
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Sigref: a symbolic bisimulation tool box
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
This paper presents a novel algorithm to compute weak bisimulation quotients for finite acyclic models. It is developed in the setting of interactive Markov chains, a model overarching both labelled transition systems and continuous-time Markov chains. This model has lately been used to give an acyclic compositional semantics to dynamic fault trees, a reliability modelling formalism.While the theoretical complexity does not change substantially, the algorithm performs very well in practice, almost linear in the size of the input model. We use a number of case studies to show that it is vastly more efficient than the standard bisimulation minimisation algorithms. In particular we show the effectiveness in the analysis of dynamic fault trees.