Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
type: Item
instance of: scholarly article
title: Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
zbMATH Open document ID: 1169.68031
author: Nadia Busi
author: Roberto Gorrieri
published in: The Journal of Logic and Algebraic Programming
publication date: 2009-03-20T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 5530604
zbMATH Keywords: Petri nets
zbMATH Keywords: process algebra
zbMATH Keywords: \(\pi \)-calculus
zbMATH Keywords: non-interleaving semantics
zbMATH Keywords: decidable properties
describes a project that uses: Petruchio
MaRDI profile type: Publication
full work available at URL: j.jlap.2008.08.002
OpenAlex ID: W2071574641
cites work: The chemical abstract machine
cites work: A unified model for nets and process algebras
cites work: A fully abstract semantics for causality in the \(\pi\)-calculus
cites work: Analysis issues in Petri nets with inhibitor arcs
cites work: Q4948012
cites work: Q4526681
cites work: Complexity results for 1-safe nets
cites work: Model checking mobile processes
cites work: A distributed operational semantics of CCS based on condition/event systems
cites work: Q3821598
cites work: Causality for mobile processes
cites work: Non-interleaving semantics for mobile processes
cites work: Q5480176
cites work: A Petri Net Translation of π-Calculus Terms
cites work: A multiset semantics for the pi-calculus with replication
cites work: Q4954445
cites work: Decidability of model checking for infinite-state concurrent systems
cites work: Q3771632
cites work: Q3795192
cites work: Finite Petri nets as models for recursive causal behaviour
cites work: On the implementation of concurrent calculi in net calculi: two case studies
cites work: Semantics of inhibitor nets
cites work: Causality and true concurrency: A data-flow analysis of the Pi-Calculus
cites work: Parallel program schemata
cites work: Results on the propositional \(\mu\)-calculus
cites work: An Algorithm for the General Petri Net Reachability Problem
cites work: A theory of structural stationarity in the \(\pi\)-calculus
cites work: A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
cites work: Q3992568
cites work: A calculus of mobile processes. II
cites work: Minimal transition systems for history-preserving bisimulation
cites work: Contextual nets
cites work: Nets, Terms and Formulas
cites work: Q3805922
cites work: Q3219122
cites work: The \(\pi\)-calculus: A theory of mobile processes
cites work: Q4699325
DOI: 10.1016/J.JLAP.2008.08.002
Recommended article: Formal Techniques for Networked and Distributed Systems – FORTE 2004
Recommended article: Q5480176
Recommended article: Interval semantics for Petri nets with inhibitor arcs
Recommended article: On Interval Process Semantics of Petri Nets with Inhibitor Arcs
Recommended article: Bisimulations for a Distributed Higher Order π-Calculus
Recommended article: On Distributability of Petri Nets
Recommended article: Q4536619
Recommended article: Q2766567
Recommended article: Domain and event structure semantics for Petri nets with read and inhibitor arcs
Recommended article: A Logic for Distributed Higher Order π-Calculus
description: scientific article; zbMATH DE number 5530604