Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states

DOI10.1016/J.IC.2014.02.001zbMath1360.68571arXiv1205.6192OpenAlexW1971346686MaRDI QIDQ2252526

Markus Siegle, Johann Schuster

Publication date: 18 July 2014

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

Full work available at URL: https://arxiv.org/abs/1205.6192

zbMATH Keywords

eliminationweak bisimulationMarkov automatavanishing state

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)

Similarity-based minimization of fuzzy tree automata ⋮ Probabilistic bisimulation for realistic schedulers ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states ⋮ The quest for minimal quotients for probabilistic and Markov automata ⋮ Probabilistic Bisimulation for Realistic Schedulers

Cites Work

• Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
• Improving Time Bounded Reachability Computations in Interactive Markov Chains
• Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
• On the Semantics of Markov Automata
• Concurrency and Composition in a Stochastic World
• The Quest for Minimal Quotients for Probabilistic Automata
• Deciding Bisimilarities on Distributions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states