Non-interleaving bisimulation equivalences on basic parallel processes

DOI10.1016/j.ic.2009.06.001zbMath1185.68444OpenAlexW2136901681MaRDI QIDQ1049404

Petr Jančar, Sibylle Fröschle, Zdeněk Sawa, Sławomir Lasota

Publication date: 12 January 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.06.001

zbMATH Keywords

verificationequivalence checkingbisimulation equivalencelabelled event structuresbasic parallel processeshereditary history preserving bisimilarityhistory preserving bisimilaritynon-interleaving equivalences

Mathematics Subject Classification ID

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

Related Items

Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems, Characterising spectra of equivalences for event structures, logically, A Study on Team Bisimulations for BPP Nets, Space-efficient scheduling of stochastically generated tasks, Team bisimilarity, and its associated modal logic, for BPP nets, Causal Semantics for BPP Nets with Silent Moves, A study on team bisimulation and H-team bisimulation for BPP nets

Cites Work

• A theory of processes with durational actions
• The decidability border of hereditary history preserving bisimilarity
• Deciding true concurrency equivalences on safe, finite nets
• Undecidability of domino games and hhp-bisimilarity.
• Process rewrite systems.
• Bisimulation from open maps
• Decidability of performance equivalence for basic parallel processes
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
• Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
• Mathematical Foundations of Computer Science 2003
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item