On the semantics of Markov automata

DOI10.1016/J.IC.2012.10.010zbMath1286.68362OpenAlexW2117429544MaRDI QIDQ1951578

Yu-xin Deng, Matthew C. B. Hennessy

Publication date: 6 June 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2012.10.010

zbMATH Keywords

congruenceweak bisimulationCCSMarkov automatabarbed equivalence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) 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 (17)

Markov automata with multiple objectives ⋮ Probabilistic bisimulation for realistic schedulers ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ On the probabilistic bisimulation spectrum with silent moves ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ Confluence reduction for Markov automata ⋮ Persistent Stochastic Non-Interference ⋮ The quest for minimal quotients for probabilistic and Markov automata ⋮ Probabilistic Bisimulation for Realistic Schedulers ⋮ Multi-objective optimization of long-run average and total rewards ⋮ Unnamed Item ⋮ The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism ⋮ Termination in Convex Sets of Distributions ⋮ Unnamed Item ⋮ Efficient approximation of optimal control for continuous-time Markov games

This page was built for publication: On the semantics of Markov automata