Distributed semantics for the -calculus based on Petri nets with inhibitor ARCS
DOI10.1016/J.JLAP.2008.08.002zbMATH Open1169.68031OpenAlexW2071574641MaRDI QIDQ1007235FDOQ1007235
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
Recommendations
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Petri net semantics of the finite \(\pi\)-calculus terms
- Interval semantics for Petri nets with inhibitor arcs
- On interval process semantics of Petri nets with inhibitor arcs
- Bisimulations for a Distributed Higher Order π-Calculus
- On Distributability of Petri Nets
- scientific article; zbMATH DE number 1759628
- scientific article; zbMATH DE number 1696460
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- A Logic for Distributed Higher Order π-Calculus
Semantics in the theory of computing (68Q55) 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
- A fully abstract semantics for causality in the \(\pi\)-calculus
- Non-interleaving semantics for mobile processes
- Parallel program schemata
- Title not available (Why is that?)
- Title not available (Why is that?)
- The chemical abstract machine
- A calculus of mobile processes. II
- Results on the propositional \(\mu\)-calculus
- Decidability of model checking for infinite-state concurrent systems
- The \(\pi\)-calculus: A theory of mobile processes
- Title not available (Why is that?)
- Minimal transition systems for history-preserving bisimulation
- An Algorithm for the General Petri Net Reachability Problem
- Nets, Terms and Formulas
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis issues in Petri nets with inhibitor arcs
- Semantics of inhibitor nets
- Contextual nets
- A distributed operational semantics of CCS based on condition/event systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- Complexity results for 1-safe nets
- A unified model for nets and process algebras
- Finite Petri nets as models for recursive causal behaviour
- A multiset semantics for the pi-calculus with replication
- On the implementation of concurrent calculi in net calculi: two case studies
- A Petri Net Translation of π-Calculus Terms
- Title not available (Why is that?)
- Petri net semantics of the finite \(\pi\)-calculus terms
- Model checking mobile processes
- Title not available (Why is that?)
- Causality for mobile processes
Cited In (11)
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Asynchronous Traces and Open Petri Nets
- Language Representability of Finite P/T Nets
- Extensional Petri net
- Typed event structures and the linear \(\pi \)-calculus
- A Petri Net Interpretation of Open Reconfigurable Systems
- Nadia Busi's publications
- Encoding Asynchronous Interactions Using Open Petri Nets
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- A theory of structural stationarity in the \(\pi\)-calculus
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
Uses Software
This page was built for publication: Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007235)
