Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
From MaRDI portal
Publication:2272985
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
- 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?)
- 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 DPDA equivalence
- Decidability of bisimulation equivalence for normed pushdown processes
- 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
- Language equivalence of probabilistic pushdown automata
- Model Checking Probabilistic Pushdown Automata
- Model checking of probabilistic and nondeterministic systems
- 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)
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)
