Probabilistic bisimulation for realistic schedulers
DOI10.1007/s00236-018-0313-1zbMath1398.68374OpenAlexW2790309851MaRDI QIDQ1671244
Lei Song, Jens Chr. Godskesen, Holger Hermanns, David N. Jansen, Christian Eisentraut, Li-jun Zhang, Peng-fei Yang
Publication date: 6 September 2018
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-018-0313-1
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
- Interactive Markov chains. And the quest for quantified quality
- Distribution-based bisimulation for labelled Markov processes
- 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
- 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
- Branching time and abstraction in bisimulation semantics
- An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
- A Semantics for Every GSPN
- Deciding Bisimilarities on Distributions
- The Complexity of Decentralized Control of Markov Decision Processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Probabilistic bisimulation for realistic schedulers
