Encoding Asynchronous Interactions Using Open Petri Nets

DOI10.1007/978-3-642-04081-8_8zbMath1254.68161OpenAlexW2123152050MaRDI QIDQ3184668

Paolo Baldan, Filippo Bonchi, Fabio Gadducci

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_8

zbMATH Keywords

decidabilitybisimilarityasynchronous calculiopen Petri nets

Mathematics Subject Classification ID

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

Related Items

Unnamed Item ⋮ Extensional Petri net ⋮ Concurrency cannot be observed, asynchronously ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding

Uses Software

• Petruchio
• KLAIM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• Undecidability of bisimilarity for Petri nets and some related problems
• A compositional Petri net translation of general \(\pi\)-calculus terms
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
• A calculus of communicating systems
• The chemical abstract machine
• On bisimulations for the asynchronous \(\pi\)-calculus
• Expired data collection in shared dataspaces.
• A process algebraic view of shared dataspace coordination
• Pure bigraphs: structure and dynamics
• On the Expressive Power of Restriction and Priorities in CCS with Replication
• Nets, Terms and Formulas
• On the bisimulation proof method
• Compositional semantics for open Petri nets based on deterministic processes
• Making the Unobservable, Unobservable
• Graph rewriting for the π-calculus
• Automata, Languages and Programming
• Lectures on Concurrency and Petri Nets
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings