Non-interleaving bisimulation equivalences on basic parallel processes

DOI10.1016/J.IC.2009.06.001MaRDI QIDQ1049404zbMATH OpenOpenAlexFDO

Authors Sibylle Fröschle, Petr Jančar, 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

basic parallel processesbisimulation equivalenceequivalence checkinghereditary history preserving bisimilarityhistory preserving bisimilaritylabelled event structuresnon-interleaving equivalencesverification

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1670835
• Bisimilarity on basic parallel processes
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
• Approximating weak bisimilarity of basic parallel processes
• scientific article; zbMATH DE number 1701362
• scientific article; zbMATH DE number 1232246
• Publication:4490743
• Undecidable equivalences for basic parallel processes
• On the parallel complexity of bisimulation on finite systems

Cites work

• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
• A theory of processes with durational actions
• Bisimulation from open maps
• CONCUR 2005 – Concurrency Theory
• Decidability of performance equivalence for basic parallel processes
• Deciding true concurrency equivalences on safe, finite nets
• scientific article; zbMATH DE number 17804 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 86273 (Why is no real title available?)
• scientific article; zbMATH DE number 86276 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1059894 (Why is no real title available?)
• scientific article; zbMATH DE number 2155191 (Why is no real title available?)
• scientific article; zbMATH DE number 2086414 (Why is no real title available?)
• scientific article; zbMATH DE number 1418351 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Normed processes, unique decomposition, and complexity of bisimulation equivalences
• Process rewrite systems.
• The decidability border of hereditary history preserving bisimilarity
• Undecidability of domino games and hhp-bisimilarity.

Cited in

(17)

• A study on team bisimulation and H-team bisimulation for BPP nets
• Team bisimilarity, and its associated modal logic, for BPP nets
• Characterising spectra of equivalences for event structures, logically
• Causality, behavioural equivalences, and the security of cyberphysical systems
• More on Weak Bisimilarity of Normed Basic Parallel Processes
• Space-efficient scheduling of stochastically generated tasks
• scientific article; zbMATH DE number 1232246 (Why is no real title available?)
• Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
• scientific article; zbMATH DE number 1051237 (Why is no real title available?)
• scientific article; zbMATH DE number 1096856 (Why is no real title available?)
• Behavioural equivalence for infinite systems -- partially decidable!
• A Study on Team Bisimulations for BPP Nets
• Causal Semantics for BPP Nets with Silent Moves
• Mathematical Foundations of Computer Science 2003
• Algebra and Coalgebra in Computer Science
• Deciding bisimulation and trace equivalences for systems with many identical processes
• Alternative characterizations of hereditary history-preserving bisimilarity via backward ready multisets

This page was built for publication: Non-interleaving bisimulation equivalences on basic parallel processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1049404)