Bisimulation collapse and the process taxonomy

DOI10.1007/3-540-61604-7_59zbMath1514.68158OpenAlexW1480220904MaRDI QIDQ6104377

Olaf Burkart, Didier Caucal, Bernhard Steffen

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_59

Mathematics Subject Classification ID

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

Related Items (11)

Regularity of normed PA processes ⋮ Bisimulation equivalence is decidable for one-counter processes ⋮ Characteristic invariants in Hennessy-Milner logic ⋮ Generative program analysis and beyond: the power of domain-specific languages (invited paper) ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ Decidability of model checking with the temporal logic EF ⋮ Basic process algebra with deadlocking states ⋮ Decidability of bisimulation equivalence for normed pushdown processes ⋮ Process rewrite systems. ⋮ Decidability of bisimilarity for one-counter processes. ⋮ Reflections on a Geometry of Processes

Cites Work

• On the regular structure of prefix rewriting
• A short proof of the decidability of bisimulation for normed BPA- processes
• Graphes canoniques de graphes algébriques
• An elementary bisimulation decision procedure for arbitrary context-free processes
• Regular canonical systems
• Decidability of bisimulation equivalence for normed pushdown processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bisimulation collapse and the process taxonomy