On the Semantics of Markov Automata

DOI10.1007/978-3-642-22012-8_24zbMath1333.68162OpenAlexW3021888099MaRDI QIDQ3012929

Yu-xin Deng, Matthew C. B. Hennessy

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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 (6)

Exploring probabilistic bisimulations. I ⋮ Polynomial time decision algorithms for probabilistic automata ⋮ Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states ⋮ Relating reasoning methodologies in linear logic and process algebra ⋮ The quest for minimal quotients for probabilistic and Markov automata ⋮ The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic logical characterization
• Interactive Markov chains. And the quest for quantified quality
• Calculi for synchrony and asynchrony
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• A hierarchy of equivalences for asynchronous calculi
• Weak bisimulation is sound and complete for pCTL\(^*\)
• Probabilistic Barbed Congruence
• Testing Finitary Probabilistic Processes
• Deriving Structural Labelled Transitions for Mobile Ambients
• Contextual equivalence for higher-order pi-calculus revisited
• A Compositional Approach to Performance Modelling

This page was built for publication: On the Semantics of Markov Automata