Process Algebras for Petri Nets

2017 ◽  
Author(s):  
Roberto Gorrieri
Keyword(s):  
Petri Nets ◽  
Process Algebras

Highly Undecidable Questions for Process Algebras

2004 ◽  
Vol 11 (8) ◽  
Author(s):  
Petr Jancar ◽  
Jirí Srba
Keyword(s):  
Petri Nets ◽  
Process Algebra ◽  
Basic Process ◽  
Process Algebras ◽  
Parallel Processes ◽  
Pushdown Automata ◽  
Trace Equivalence

We show Sigma^1_1-completeness of weak bisimilarity for PA (process algebra), and of weak simulation preorder/equivalence for PDA (pushdown automata), PA and PN (Petri nets). We also show Pi^1_1-hardness of weak omega-trace equivalence for the (sub)classes BPA (basic process algebra) and BPP (basic parallel processes).

scholarly journals Open Maps (at) Work

1995 ◽  
Vol 2 (23) ◽  
Author(s):  
Allan Cheng ◽  
Mogens Nielsen
Keyword(s):  
Petri Nets ◽  
Parallel Computation ◽  
Functional Languages ◽  
Process Algebras ◽  
Representative Selection ◽  
Definition Of ◽  
Testing Equivalence ◽  
Selection Of ◽  
Open Maps

The notion of bisimilarity, as defined by Park and Milner,<br />has turned out to be one of the most fundamental notions of operational<br />equivalences in the field of process algebras. Not only does it induce<br />a congruence (largest bisimulation) in CCS which has nice equational<br />properties, it has also proven itself applicable for numerous models of<br />parallel computation and settings such as Petri Nets and semantics of<br />functional languages. In an attempt to understand the relationships and<br />differences between the extensive amount of research within the field,<br />Joyal, Nielsen, and Winskel recently presented an abstract category-theoretic <br />definition of bisimulation. They identify spans of morphisms satisfying certain "path lifting"<br /> properties, so-called open maps, as a possible abstract definition of bisimilarity.<br /> In [JNW93] they show, that they can capture Park and Milner's bisimulation. <br />The aim of this paper is to show that the abstract definition of bisimilarity is applicable<br />"in practice" by showing how a representative selection of well-known<br />bisimulations and equivalences, such as e.g. Hennessy's testing equivalence,<br />Milner and Sangiorgi's barbed bisimulation, and Larsen and Skou's<br />probabilistic bisimulation, are captured in the setting of open maps and<br />hence, that the proposed notion of open maps seems successful. Hence,<br />we confirm that the treatment of strong bisimulation in [JNW93] is not<br />a one-off application of open maps.

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