Decidability of bisimulation equivalence for normed pushdown processes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4035115 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 139799 (Why is no real title available?)
- scientific article; zbMATH DE number 1231553 (Why is no real title available?)
- scientific article; zbMATH DE number 1479629 (Why is no real title available?)
- scientific article; zbMATH DE number 2102748 (Why is no real title available?)
- scientific article; zbMATH DE number 794257 (Why is no real title available?)
- scientific article; zbMATH DE number 1414283 (Why is no real title available?)
- A short proof of the decidability of bisimulation for normed BPA- processes
- Actions speak louder than words: proving bisimilarity for context-free processes
- An elementary bisimulation decision procedure for arbitrary context-free processes
- Bisimulation collapse and the process taxonomy
- Bisimulation equivalence is decidable for all context-free processes
- Decidability of bisimulation equivalence for process generating context-free languages
- Graphes canoniques de graphes algébriques
- Infinite results
- On the regular structure of prefix rewriting
- Recursive process definitions with the state operator
- The equivalence problem for real-time strict deterministic languages
- The theory of ends, pushdown automata, and second-order logic
- Undecidable equivalences for basic process algebra
Cited in
(17)- A complete normal-form bisimilarity for state
- Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence.
- Decidability of weak bisimilarity for a subset of BPA
- The complexity of bisimilarity-checking for one-counter processes.
- On the computational complexity of bisimulation, redux
- Bisimulation Finiteness of Pushdown Systems Is Elementary
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
- Linearly bounded infinite graphs
- Decidability of DPDA equivalence
- scientific article; zbMATH DE number 4035115 (Why is no real title available?)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
- Deciding bisimulation-like equivalences with finite-state processes
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity
- scientific article; zbMATH DE number 1232246 (Why is no real title available?)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
- scientific article; zbMATH DE number 1231554 (Why is no real title available?)
- Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols
This page was built for publication: Decidability of bisimulation equivalence for normed pushdown processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276237)
