CONCUR 2003 - Concurrency Theory

DOI10.1007/B11938MaRDI QIDQ5900585zbMATH OpenOpenAlexFDO

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

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) Continuous-time Markov processes on discrete state spaces (60J27) Specification and verification (program logics, model checking, etc.) (68Q60) 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)

Recommendations

• Comparative branching-time semantics for Markov chains
• Transition semantics for branching time
• Applying Formal Methods: Testing, Performance, and M/E-Commerce
• Branching-time model-checking of probabilistic pushdown automata
• Branching-time model-checking of probabilistic pushdown automata
• Bisimulations and logical characterizations on continuous-time Markov decision processes
• Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
• Towards automata for branching time and partial order
• Time-bounded model checking of infinite-state continuous-time Markov chains
• Topological aspects of branching-time semantics

Cited in

(10)

• Probabilistic weak simulation is decidable in polynomial time
• Logical characterization of fluid equivalences
• Comparative branching-time semantics for Markov chains
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
• Bisimulations and logical characterizations on continuous-time Markov decision processes
• scientific article; zbMATH DE number 1927572 (Why is no real title available?)
• Applying Formal Methods: Testing, Performance, and M/E-Commerce
• Approximate verification of the symbolic dynamics of Markov chains
• Trace machines for observing continuous-time Markov chains

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900585)