Decidability of bisimulation equivalence for normed pushdown processes

DOI10.1007/3-540-61604-7_57MaRDI QIDQ6104375zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A short proof of the decidability of bisimulation for normed BPA- processes
• 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
• 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 794257 (Why is no real title available?)
• scientific article; zbMATH DE number 1414283 (Why is no real title available?)
• On the regular structure of prefix rewriting
• 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

(10)

• A general theory of action languages
• Complete formal systems for equivalence problems
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Model checking of systems with many identical timed processes
• Decidability of bisimilarity for one-counter processes.
• Bisimulation equivalence is decidable for one-counter processes
• The equivalence problem for deterministic pushdown automata is decidable
• Pushdown automata, multiset automata, and Petri nets
• Ensuring completeness of symbolic verification methods for infinite-state systems
• Bisimulation collapse and the process taxonomy

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)