Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP

DOI10.1007/978-3-319-23506-6_9zbMath1444.68125arXiv1509.05842OpenAlexW2207746424MaRDI QIDQ3449628

Robert J. van Glabbeek

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.05842

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

Verification of finite-state machines: a distributed approach ⋮ Interleaving vs True Concurrency: Some Instructive Security Examples ⋮ A Study on Team Bisimulations for BPP Nets ⋮ Just testing ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets ⋮ Team equivalences for finite-state machines with silent moves ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Global types with internal delegation ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using branching time temporal logic to synthesize synchronization skeletons
• Specification-oriented semantics for communicating processes
• Concurrent systems and inevitability
• Petri nets, event structures and domains. I
• Branching processes of Petri nets
• The difference between splitting in \(n\) and \(n+1\)
• A structural approach to operational semantics
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Concurrent bisimulations in Petri nets
• A Process Algebra for Wireless Mesh Networks
• The non-sequential behaviour of Petri nets
• A Theory of Communicating Sequential Processes
• Nets, Terms and Formulas
• On the semantics of place/transition Petri nets
• Understanding Petri Nets
• CONCUR 2005 – Concurrency Theory
• Refinement of actions and equivalence notions for concurrent systems

This page was built for publication: Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP