Petri nets semantics of π-calculus

2008 ◽  
Vol 3 (3) ◽  
pp. 290-294
Author(s):  
Zhenhua Yu ◽  
Yuanli Cai ◽  
Haiping Xu
Keyword(s):  
Petri Nets ◽  
Π Calculus

scholarly journals Synchrony versus causality in distributed systems

2014 ◽  
Vol 26 (8) ◽  
pp. 1459-1498 ◽  
Author(s):  
KIRSTIN PETERS ◽  
JENS-WOLFHARD SCHICKE-UFFMANN ◽  
URSULA GOLTZ ◽  
UWE NESTMANN
Keyword(s):  
Distributed Systems ◽  
Petri Nets ◽  
Synchronous System ◽  
Π Calculus ◽  
Asynchronous Interactions

Given a synchronous system, we study the question whether – or, under which conditions – the behaviour of that system can be realized by a (non-trivially) distributed and hence asynchronous implementation. In this paper, we partially answer this question by examining the role of causality for the implementation of synchrony in two fundamental different formalisms of concurrency, Petri nets and the π-calculus. For both formalisms it turns out that each ‘good’ encoding of synchronous interactions using just asynchronous interactions introduces causal dependencies in the translation.

Concurrency cannot be observed, asynchronously

2014 ◽  
Vol 25 (4) ◽  
pp. 978-1004 ◽  
Author(s):  
PAOLO BALDAN ◽  
FILIPPO BONCHI ◽  
FABIO GADDUCCI ◽  
GIACOMA VALENTINA MONREALE
Keyword(s):  
Petri Nets ◽  
Case Studies ◽  
Weak Equivalence ◽  
Asynchronous Systems ◽  
Preliminary Step ◽  
Π Calculus ◽  
Asynchronous Interactions ◽  
Visual Specification

The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the introduction of a non-interleaving extension of barbed equivalence. This notion is then exploited in order to prove thatconcurrency cannot be observedthrough asynchronous interactions, i.e., that the interleaving and concurrent versions of a suitable asynchronous weak equivalence actually coincide. The theory is validated on some case studies, related to nominal calculi (π-calculus) and visual specification formalisms (Petri nets). Additionally, we prove that a class of systems which is deemed (output-buffered) asynchronous, according to a characterization that was previously proposed in the literature, falls into our theory.

Modeling Human-Robot Interaction with Petri-Nets

2009 ◽  
Author(s):  
Rosemarie Yagoda ◽  
Michael D. Coovert
Keyword(s):  
Petri Nets ◽  
Human Robot Interaction ◽  
Robot Interaction

ESPNET: expert-system-based simulator of Petri nets

1988 ◽  
Vol 135 (4) ◽  
pp. 239 ◽  
Author(s):  
J. Duggan ◽  
J. Browne
Keyword(s):  
Expert System ◽  
Petri Nets

A Reduction Method of Timed Petri Nets for a Hierarchical Scheduling

1995 ◽  
Vol 115 (7) ◽  
pp. 914-919
Author(s):  
Kazuyuki Mori ◽  
Makoto Tsukiyama ◽  
Toyoo Fukuda
Keyword(s):  
Petri Nets ◽  
Reduction Method ◽  
Timed Petri Nets ◽  
Hierarchical Scheduling
Sign in / Sign up

Export Citation Format

Share Document