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

DOI10.1016/J.IC.2019.05.004zbMATH Open1430.68147OpenAlexW2944963859WikidataQ127799649 ScholiaQ127799649MaRDI QIDQ2272985FDOQ2272985

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/

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

zbMATH Keywords

infinite-state systemssimulation preorderprobabilistic pushdown automata

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On probabilistic pushdown automata
• Process algebra for synchronous communication
• Title not available (Why is that?)
• Bisimulation through probabilistic testing
• Model checking of probabilistic and nondeterministic systems
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Title not available (Why is that?)
• Verification on infinite structures.
• Decidability of DPDA equivalence
• Abstraction, Refinement and Proof for Probabilistic Systems
• Deciding bisimulation-like equivalences with finite-state processes
• Pushdown processes: Games and model-checking
• Model Checking Probabilistic Pushdown Automata
• Analyzing probabilistic pushdown automata
• Branching-time model-checking of probabilistic pushdown automata
• STACS 2005
• Automata, Languages and Programming
• Undecidable equivalences for basic process algebra
• Decidability of bisimulation equivalence for normed pushdown processes
• Properties of probabilistic pushdown automata
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
• Complex probabilistic modeling with recursive relational Bayesian networks
• Reasoning about Recursive Probabilistic Programs
• Language equivalence of probabilistic pushdown automata
• 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

Cited In (4)

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

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)