Decidability of bisimulation equivalence for normed pushdown processes
From MaRDI portal
Publication:1276237
DOI10.1016/S0304-3975(97)00216-8zbMATH Open0915.68119OpenAlexW2118539487MaRDI QIDQ1276237FDOQ1276237
Authors: Colin Stirling 
Publication date: 20 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00216-8
Cites Work
- Title not available (Why is that?)
- Bisimulation collapse and the process taxonomy
- The theory of ends, pushdown automata, and second-order logic
- Undecidable equivalences for basic process algebra
- Title not available (Why is that?)
- Bisimulation equivalence is decidable for all context-free processes
- Title not available (Why is that?)
- Infinite results
- Graphes canoniques de graphes algébriques
- The equivalence problem for real-time strict deterministic languages
- Decidability of bisimulation equivalence for process generating context-free languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the regular structure of prefix rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- An elementary bisimulation decision procedure for arbitrary context-free processes
- Title not available (Why is that?)
- Recursive process definitions with the state operator
- A short proof of the decidability of bisimulation for normed BPA- processes
- Actions speak louder than words: proving bisimilarity for context-free processes
Cited In (17)
- A complete normal-form bisimilarity for state
- Decidability of weak bisimilarity for a subset of BPA
- Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence.
- The complexity of bisimilarity-checking for one-counter processes.
- Bisimulation Finiteness of Pushdown Systems Is Elementary
- On the computational complexity of bisimulation, redux
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
- Linearly bounded infinite graphs
- Decidability of DPDA equivalence
- Title not available (Why is that?)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
- Deciding bisimulation-like equivalences with finite-state processes
- Title not available (Why is that?)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
- Title not available (Why is that?)
- 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)
