Concurrency and Composition in a Stochastic World
From MaRDI portal
Publication:3584919
DOI10.1007/978-3-642-15375-4_3zbMath1287.68132MaRDI 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
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Unnamed Item, Unnamed Item, Probabilistic Bisimulation for Realistic Schedulers, A Semantics for Every GSPN, Deciding probabilistic automata weak bisimulation: theory and practice, Polynomial time decision algorithms for probabilistic automata, Confluence reduction for Markov automata, Probabilistic bisimulation for realistic schedulers, The quest for minimal quotients for probabilistic and Markov automata, Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states, A Tutorial on Interactive Markov Chains, Computing Behavioral Relations for Probabilistic Concurrent Systems, The How and Why of Interactive Markov Chains
Uses Software
