Concurrency and Composition in a Stochastic World
From MaRDI portal
Publication:3584919
DOI10.1007/978-3-642-15375-4_3zbMath1287.68132OpenAlexW1507380329MaRDI QIDQ3584919
Holger Hermanns, Christian Eisentraut, Li-jun Zhang
Publication date: 31 August 2010
Published in: CONCUR 2010 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15375-4_3
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 (15)
Deciding probabilistic automata weak bisimulation: theory and practice ⋮ Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ A Semantics for Every GSPN ⋮ Probabilistic bisimulation for realistic schedulers ⋮ A Tutorial on Interactive Markov Chains ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Polynomial time decision algorithms for probabilistic automata ⋮ Confluence reduction for Markov automata ⋮ Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states ⋮ The quest for minimal quotients for probabilistic and Markov automata ⋮ The How and Why of Interactive Markov Chains ⋮ Probabilistic Bisimulation for Realistic Schedulers ⋮ Unnamed Item ⋮ Unnamed Item
Uses Software
This page was built for publication: Concurrency and Composition in a Stochastic World
