Decidability of bisimulation equivalence for normed pushdown processes
From MaRDI portal
Publication:6104375
DOI10.1007/3-540-61604-7_57zbMATH Open1514.68183OpenAlexW4244180300MaRDI QIDQ6104375FDOQ6104375
Authors: Colin Stirling 
Publication date: 28 June 2023
Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61604-7_57
Cites Work
- Title not available (Why is that?)
- 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
- 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?)
- On the regular structure of prefix rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- A short proof of the decidability of bisimulation for normed BPA- processes
Cited In (10)
- The equivalence problem for deterministic pushdown automata is decidable
- Bisimulation equivalence is decidable for one-counter processes
- Decidability of bisimilarity for one-counter processes.
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Pushdown automata, multiset automata, and Petri nets
- Complete formal systems for equivalence problems
- Bisimulation collapse and the process taxonomy
- Ensuring completeness of symbolic verification methods for infinite-state systems
- A general theory of action languages
- Model checking of systems with many identical timed processes
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 Q6104375)
