Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems

DOI10.1016/J.IC.2019.05.004MaRDI QIDQ2272985zbMATH OpenOpenAlexWikidataFDO

Authors Mingzhang Huang, Hongfei Fu, Joost-Pieter Katoen

Publication date 17 September 2019

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

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2011/3343/

zbMATH Keywords

infinite-state systemsprobabilistic pushdown automatasimulation preorder

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
• Bisimilarity of probabilistic pushdown automata
• Game characterization of probabilistic bisimilarity, and applications to pushdown automata
• STACS 2005
• Deciding probabilistic bisimilarity over infinite-state probabilistic systems

Cites work

• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
• Abstraction, Refinement and Proof for Probabilistic Systems
• Analyzing probabilistic pushdown automata
• Automata, Languages and Programming
• Bisimulation through probabilistic testing
• Branching-time model-checking of probabilistic pushdown automata
• Complex probabilistic modeling with recursive relational Bayesian networks
• Decidability of bisimulation equivalence for normed pushdown processes
• Decidability of DPDA equivalence
• Deciding bisimulation-like equivalences with finite-state processes
• Deciding probabilistic bisimilarity over infinite-state probabilistic systems
• Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
• Game characterization of probabilistic bisimilarity, and applications to pushdown automata
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Language equivalence of probabilistic pushdown automata
• Model checking of probabilistic and nondeterministic systems
• Model Checking Probabilistic Pushdown Automata
• On probabilistic pushdown automata
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
• Process algebra for synchronous communication
• Properties of probabilistic pushdown automata
• Pushdown processes: Games and model-checking
• Reasoning about Recursive Probabilistic Programs
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• STACS 2005
• Undecidable equivalences for basic process algebra
• Verification on infinite structures.

Cited in

(4)

• Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
• Bisimilarity of probabilistic pushdown automata
• Game characterization of probabilistic bisimilarity, and applications to pushdown automata
• STACS 2005

This page was built for publication: Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems

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