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

DOI10.1007/978-3-642-04081-8_31zbMATH Open1254.68175OpenAlexW1799668602MaRDI QIDQ3184693FDOQ3184693

Authors: Roland Meyer, Roberto Gorrieri 

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

Recommendations

• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Petri net semantics of the finite \(\pi\)-calculus terms
• A Petri Net Translation of π-Calculus Terms
• A polynomial translation of \(\pi\)-calculus FCPS to safe Petri nets
• A process calculus for expressing finite place/transition Petri nets

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• Petri net semantics of the finite \(\pi\)-calculus terms
• Multiset rewriting for the verification of depth-bounded processes with name binding
• Using session types for reasoning about boundedness in the \(\pi\)-calculus
• Deciding safety properties in infinite-state pi-calculus via behavioural types
• Interpreting a finitary pi-calculus in differential interaction nets
• On hierarchical communication topologies in the \(\pi\)-calculus
• Constructing and visualizing chemical reaction networks from pi-calculus models
• A theory of structural stationarity in the \(\pi\)-calculus
• When to move to transfer nets. On the limits of Petri nets as models for process calculi
• A polynomial translation of \(\pi\)-calculus FCPS to safe Petri nets
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• A Petri net interpretation of open reconfigurable systems

Uses Software

• Petruchio

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

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