ACM Transactions on Computer Systems (TOCS)
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Modelling with Generalized Stochastic Petri Nets
Modelling with Generalized Stochastic Petri Nets
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Partial $\tau$-confluence for efficient state space generation
Partial $\'tau$-confluence for efficient state space generation
Partial Order Reduction for Probabilistic Systems
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Partial Order Reduction on Concurrent Probabilistic Programs
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Simplifying Itai-Rodeh Leader Election for Anonymous Rings
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Probabilistic Branching Time
Electronic Notes in Theoretical Computer Science (ENTCS)
A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis
IEEE Transactions on Dependable and Secure Computing
Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On Probabilistic Automata in Continuous Time
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
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
Safety, Dependability and Performance Analysis of Extended AADL Models
The Computer Journal
On the semantics of Markov automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
SCOOP: A Tool for SymboliC Optimisations of Probabilistic Processes
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
GSPNs Revisited: Simple Semantics and New Analysis Algorithms
ACSD '12 Proceedings of the 2012 12th International Conference on Application of Concurrency to System Design
Efficient modelling and generation of Markov automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models generated by such specifications. We therefore introduce confluence reduction for Markov automata, a powerful reduction technique to keep these models small. We define the notion of confluence directly on Markov automata, and discuss how to syntactically detect confluence on the MAPA language as well. That way, Markov automata generated by MAPA specifications can be reduced on-the-fly while preserving divergence-sensitive branching bisimulation. Three case studies demonstrate the significance of our approach, with reductions in analysis time up to an order of magnitude.