Deciding probabilistic bisimilarity over infinite-state probabilistic systems

DOI10.1007/s00236-007-0066-8zbMath1138.68039OpenAlexW2020335855MaRDI QIDQ2482725

Tomáš Brázdil, Antonín Kučera, Oldřich Stražovský

Publication date: 23 April 2008

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-007-0066-8

zbMATH Keywords

probabilistic pushdown automatafinite-state systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Language equivalence of probabilistic pushdown automata ⋮ Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic weak simulation is decidable in polynomial time
• A note on the attractor-property of infinite-state Markov chains
• On the consistency of Koomen's fair abstraction rule
• Bisimulation through probabilistic testing
• A logic for reasoning about time and reliability
• Verification of probabilistic systems with faulty communication
• Model checking of probabilistic and nondeterministic systems
• The complexity of probabilistic verification
• Tools and Algorithms for the Construction and Analysis of Systems
• STACS 2005
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Deciding probabilistic bisimilarity over infinite-state probabilistic systems