Probabilistic Bisimulation for Realistic Schedulers
From MaRDI portal
Publication:5206954
DOI10.1007/978-3-319-19249-9_16zbMath1427.68193OpenAlexW1131208844MaRDI QIDQ5206954
Jens Chr. Godskesen, Lei Song, Holger Hermanns, Christian Eisentraut, Li-jun Zhang
Publication date: 19 December 2019
Published in: FM 2015: Formal Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19249-9_16
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 (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interactive Markov chains. And the quest for quantified quality
- Exploring probabilistic bisimulations. I
- On the semantics of Markov automata
- Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Weak bisimulation is sound and complete for pCTL\(^*\)
- Comparative branching-time semantics for Markov chains
- Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems
- Confluence Reduction for Markov Automata
- Testing Finitary Probabilistic Processes
- Probabilistic Bisimulation: Naturally on Distributions
- Modelling and Analysis of Markov Reward Automata
- Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
- EQUIVALENCE OF LABELED MARKOV CHAINS
- Assume-Guarantee Verification for Probabilistic Systems
- Concurrency and Composition in a Stochastic World
- A Semantics for Every GSPN
- Deciding Bisimilarities on Distributions
- The Complexity of Decentralized Control of Markov Decision Processes
This page was built for publication: Probabilistic Bisimulation for Realistic Schedulers
