Analysis of Probabilistic Basic Parallel Processes

DOI10.1007/978-3-642-54830-7_3zbMath1405.68208arXiv1401.4130OpenAlexW1820171836MaRDI QIDQ5410663

Rémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.4130

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) 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

Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes, Fair Termination for Parameterized Probabilistic Concurrent Systems, Unnamed Item, Probabilistic Analysis of Binary Sessions