Confluence reduction for probabilistic systems

Authors:
Mark Timmer;Mariëlle Stoelinga;Jaco van de Pol
Affiliations:
Formal Methods and Tools, Faculty of EEMCS, University of Twente, The Netherlands;Formal Methods and Tools, Faculty of EEMCS, University of Twente, The Netherlands;Formal Methods and Tools, Faculty of EEMCS, University of Twente, The Netherlands
Venue:
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
Year:
2011

Citing 15
Cited 4

Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
Modeling and verification of randomized distributed real-time systems

Modeling and verification of randomized distributed real-time systems
Confluence for process verification

Theoretical Computer Science
Probabilistic simulations for probabilistic processes

Nordic Journal of Computing
Action versus State based Logics for Transition Systems

Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
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
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
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
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 Linear Process-Algebraic Format for Probabilistic Systems with Data

ACSD '10 Proceedings of the 2010 10th International Conference on Application of Concurrency to System Design

A linear process-algebraic format with data for probabilistic automata

Theoretical Computer Science
Heuristics for probabilistic timed automata with abstraction refinement

MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Efficient modelling and generation of Markov automata

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Confluence reduction for markov automata

FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We prove that this reduction preserves branching probabilistic bisimulation and can be applied on-the-fly. To support the technique, we introduce a method for detecting confluent transitions in the context of a probabilistic process algebra with data, facilitated by an earlier defined linear format. A case study demonstrates that significant reductions can be obtained.