The quest for minimal quotients for probabilistic and Markov automata

DOI10.1016/j.ic.2018.08.003zbMath1400.68132OpenAlexW2889143140WikidataQ129270202 ScholiaQ129270202MaRDI QIDQ1784955

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

Publication date: 27 September 2018

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

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

zbMATH Keywords

probabilistic automataweak probabilistic bisimulationMarkov automatadecision algorithmminimal quotient

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) 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)

Uses Software

• PRISM
• z3

Cites Work

• Polynomial time decision algorithms for probabilistic automata
• CCS expressions, finite state processes, and three problems of equivalence
• Algebra of communicating processes with abstraction
• Minimizing the number of transitions with respect to observation equivalence
• Essential transitions to bisimulation equivalences
• Probabilistic bisimulation for realistic schedulers
• Exploring probabilistic bisimulations. I
• On the semantics of Markov automata
• Automated compositional Markov chain generation for a plain-old telephone system
• Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
• Efficient CTMC Model Checking of Linear Real-Time Objectives
• On the Semantics of Markov Automata
• Probabilistic Bisimulation: Naturally on Distributions
• EQUIVALENCE OF LABELED MARKOV CHAINS
• Concurrency and Composition in a Stochastic World
• Three Partition Refinement Algorithms
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• The Quest for Minimal Quotients for Probabilistic Automata
• Deciding Bisimilarities on Distributions
• Probabilistic automata
• Probability and Nondeterminism in Operational Models of Concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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