The quest for minimal quotients for probabilistic automata

DOI10.1007/978-3-642-36742-7_2MaRDI QIDQ5326311zbMATH OpenOpenAlexFDO

Authors Christian Eisentraut, Holger Hermanns, Johann Schuster, Andrea Turrini, Lijun 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)

Recommendations

• The quest for minimal quotients for probabilistic and Markov automata
• scientific article; zbMATH DE number 4024799
• Stability and Complexity of Minimising Probabilistic Automata
• On the complexity of minimizing probabilistic and quantum automata
• Deciding probabilistic automata weak bisimulation: theory and practice

Cited in

(14)

• Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
• The quest for minimal quotients for probabilistic and Markov automata
• Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
• Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
• Deciding probabilistic automata weak bisimulation: theory and practice
• On Abstraction of Probabilistic Systems
• Computing Behavioral Relations for Probabilistic Concurrent Systems
• scientific article; zbMATH DE number 5734241 (Why is no real title available?)
• scientific article; zbMATH DE number 4024799 (Why is no real title available?)
• scientific article; zbMATH DE number 4119632 (Why is no real title available?)
• Stability and Complexity of Minimising Probabilistic Automata
• Artin’s Conjecture and Size of Finite Probabilistic Automata
• Performance preserving equivalence for stochastic process algebra dtsdPBC
• Coupled Similarity and Contrasimilarity, and How to Compute Them

This page was built for publication: The quest for minimal quotients for probabilistic automata

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