Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS

DOI10.1016/j.jlap.2008.08.002zbMath1169.68031OpenAlexW2071574641MaRDI QIDQ1007235

Nadia Busi, Roberto Gorrieri

Publication date: 20 March 2009

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2008.08.002

zbMATH Keywords

process algebraPetri nets\(\pi \)-calculusnon-interleaving semanticsdecidable properties

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 (10)

Asynchronous Traces and Open Petri Nets ⋮ Language Representability of Finite P/T Nets ⋮ Encoding Asynchronous Interactions Using Open Petri Nets ⋮ On the Relationship between π-Calculus and Finite Place/Transition Petri Nets ⋮ Extensional Petri net ⋮ A Petri Net Interpretation of Open Reconfigurable Systems ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ A theory of structural stationarity in the \(\pi\)-calculus ⋮ Nadia Busi's publications

Uses Software

• Petruchio

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity results for 1-safe nets
• A multiset semantics for the pi-calculus with replication
• On the implementation of concurrent calculi in net calculi: two case studies
• Results on the propositional \(\mu\)-calculus
• A theory of structural stationarity in the \(\pi\)-calculus
• A distributed operational semantics of CCS based on condition/event systems
• A fully abstract semantics for causality in the \(\pi\)-calculus
• The chemical abstract machine
• A calculus of mobile processes. II
• Non-interleaving semantics for mobile processes
• Finite Petri nets as models for recursive causal behaviour
• Analysis issues in Petri nets with inhibitor arcs
• Model checking mobile processes
• Contextual nets
• Decidability of model checking for infinite-state concurrent systems
• Semantics of inhibitor nets
• Parallel program schemata
• A Petri Net Translation of π-Calculus Terms
• An Algorithm for the General Petri Net Reachability Problem
• Nets, Terms and Formulas
• Causality for mobile processes
• Minimal transition systems for history-preserving bisimulation
• Causality and true concurrency: A data-flow analysis of the Pi-Calculus
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings

This page was built for publication: Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS