Carrying Probabilities to the Infinite World

DOI10.1007/978-3-642-23217-6_1zbMath1343.68149MaRDI QIDQ3090817

Parosh Aziz Abdulla

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_1

Mathematics Subject Classification ID

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

68Q60: Specification and verification (program logics, model checking, etc.)

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

Time-bounded termination analysis for probabilistic programs with delays

Cites Work

• Well (and Better) Quasi-Ordered Transition Systems
• Eager Markov Chains
• The complexity of probabilistic verification
• Decisive Markov Chains
• STACS 2005