On the Relationship between π-Calculus and Finite Place/Transition Petri Nets

DOI10.1007/978-3-642-04081-8_31zbMath1254.68175OpenAlexW1799668602MaRDI QIDQ3184693

Roberto Gorrieri, Roland Meyer

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_31

Mathematics Subject Classification ID

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

Related Items (7)

When to Move to Transfer Nets ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Using session types for reasoning about boundedness in the \(\pi\)-calculus ⋮ Constructing and visualizing chemical reaction networks from pi-calculus models ⋮ A Petri Net Interpretation of Open Reconfigurable Systems ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ On Hierarchical Communication Topologies in the $$\pi $$ -calculus

Uses Software

• Petruchio

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multiset semantics for the pi-calculus with replication
• A compositional Petri net translation of general \(\pi\)-calculus terms
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
• A theory of structural stationarity in the \(\pi\)-calculus
• Multisets and structural congruence of the pi-calculus with replication
• Model checking mobile processes
• A new natural structural congruence in the pi-calculus with replication
• An Algorithm for the General Petri Net Reachability Problem
• Automata, Languages and Programming
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

This page was built for publication: On the Relationship between π-Calculus and Finite Place/Transition Petri Nets