FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/11590156zbMath1172.68539OpenAlexW2484051058MaRDI QIDQ5897784

Tomáš Brázdil, Antonín Kučera

Publication date: 14 November 2006

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

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

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)

Related Items (3)

Maximizing the Conditional Expected Reward for Reaching the Goal ⋮ Deciding probabilistic bisimilarity over infinite-state probabilistic systems ⋮ Nearly Optimal Verifiable Data Streaming

This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science