Encoding Asynchronous Interactions Using Open Petri Nets

DOI10.1007/978-3-642-04081-8_8MaRDI QIDQ3184668zbMATH OpenOpenAlexFDO

Authors 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

asynchronous calculibisimilaritydecidabilityopen Petri nets

Mathematics Subject Classification ID

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

Recommendations

• Asynchronous traces and open Petri nets
• scientific article; zbMATH DE number 3896316
• A process calculus for expressing finite place/transition Petri nets
• Encoding CSP into CCS
• Place bisimulation and liveness for open Petri nets

Cites work

• A calculus of communicating systems
• A compositional Petri net translation of general -calculus terms
• A congruence for Petri nets
• A Petri net semantics of a simple process algebra for mobility
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
• A process algebraic view of shared dataspace coordination
• Automata, Languages and Programming
• Compositional semantics for open Petri nets based on deterministic processes
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
• Expired data collection in shared dataspaces.
• Graph rewriting for the π-calculus
• scientific article; zbMATH DE number 1701348 (Why is no real title available?)
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 827979 (Why is no real title available?)
• Lectures on Concurrency and Petri Nets
• Making the unobservable, unobservable
• Modular construction and partial order semantics of Petri nets
• Nets, Terms and Formulas
• On bisimulations for the asynchronous -calculus
• On the bisimulation proof method
• On the Expressive Power of Restriction and Priorities in CCS with Replication
• Pure bigraphs: structure and dynamics
• The chemical abstract machine
• Undecidability of bisimilarity for Petri nets and some related problems

Cited in

(8)

• Asynchronous traces and open Petri nets
• scientific article; zbMATH DE number 1215062 (Why is no real title available?)
• Encoding CSP into CCS
• Channel Properties of Asynchronously Composed Petri Nets
• Concurrency cannot be observed, asynchronously
• A categorical semantics for bounded Petri nets
• Extensional Petri net
• Multiset rewriting for the verification of depth-bounded processes with name binding

Describes a project that uses

Uses Software

• Petruchio
• KLAIM

This page was built for publication: Encoding Asynchronous Interactions Using Open Petri Nets

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