The Quest for Minimal Quotients for Probabilistic Automata

DOI10.1007/978-3-642-36742-7_2zbMath1381.68115OpenAlexW1656942730MaRDI QIDQ5326311

Holger Hermanns, Johann Schuster, Christian Eisentraut, Andrea Turrini, Li-jun Zhang

Publication date: 5 August 2013

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36742-7_2

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 (7)

Deciding probabilistic automata weak bisimulation: theory and practice ⋮ Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours ⋮ Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC ⋮ On Abstraction of Probabilistic Systems ⋮ 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

This page was built for publication: The Quest for Minimal Quotients for Probabilistic Automata