Probability and Nondeterminism in Operational Models of Concurrency
From MaRDI portal
Publication:5756588
DOI10.1007/11817949_5zbMath1151.68553OpenAlexW1588200817MaRDI QIDQ5756588
Publication date: 4 September 2007
Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11817949_5
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (17)
Deciding probabilistic automata weak bisimulation: theory and practice ⋮ Model independent approach to probabilistic models ⋮ Least upper bounds for probability measures and their applications to abstractions ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ Abstract probabilistic automata ⋮ Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism ⋮ Stuttering for abstract probabilistic automata ⋮ Unnamed Item ⋮ Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra ⋮ Polynomial time decision algorithms for probabilistic automata ⋮ Specification Theories for Probabilistic and Real-Time Systems ⋮ Weak bisimulation is sound and complete for pCTL\(^*\) ⋮ The quest for minimal quotients for probabilistic and Markov automata ⋮ Probabilistic NetKAT ⋮ Abstract Probabilistic Automata ⋮ Refinement Sensitive Formal Semantics of State Machines With Persistent Choice ⋮ Weighted versus Probabilistic Logics
This page was built for publication: Probability and Nondeterminism in Operational Models of Concurrency
