Confluence reduction for Markov automata
DOI10.1016/j.tcs.2016.01.017zbMath1356.68136OpenAlexW2784133204WikidataQ57800637 ScholiaQ57800637MaRDI QIDQ507382
Jaco van de Pol, Mark Timmer, Joost-Pieter Katoen, Mariëlle I. A. Stoelinga
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.017
process algebraconfluencestate space reductionpartial order reductiondivergence-sensitive branching bisimulationMarkov automata
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Uses Software
Cites Work
- Confluence for process verification
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- On the semantics of Markov automata
- A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time
- Confluence Reduction for Markov Automata
- Efficient Modelling and Generation of Markov Automata
- Analysis of Timed and Long-Run Objectives for Markov Automata
- Confluence Reduction for Probabilistic Systems
- The How and Why of Interactive Markov Chains
- Probabilistic Bisimulation: Naturally on Distributions
- EQUIVALENCE OF LABELED MARKOV CHAINS
- Model Checking Interactive Markov Chains
- Concurrency and Composition in a Stochastic World
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- State Space Reduction of Linear Processes Using Control Flow Reconstruction
- Branching time and abstraction in bisimulation semantics
- A Semantics for Every GSPN
- Depth-First Search and Linear Graph Algorithms
- Computer Aided Verification
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
