CONCUR 2003 - Concurrency Theory

DOI10.1007/b11938zbMath1274.68264OpenAlexW105220891MaRDI QIDQ5900585

Verena Wolf, Christel Baier, Holger Hermanns, Joost-Pieter Katoen

Publication date: 30 March 2010

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

Full work available at URL: https://doi.org/10.1007/b11938

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Continuous-time Markov processes on discrete state spaces (60J27) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey ⋮ Comparative branching-time semantics for Markov chains ⋮ Approximate Verification of the Symbolic Dynamics of Markov Chains ⋮ Probabilistic weak simulation is decidable in polynomial time ⋮ Logical characterization of fluid equivalences ⋮ Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes

This page was built for publication: CONCUR 2003 - Concurrency Theory