Topic
Petri net
About: Petri net is a research topic. Over the lifetime, 25039 publications have been published within this topic receiving 406994 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: Conditions under which a subnet can be substituted for a single transition while preserving properties such as liveness and boundedness are presented.
309 citations
01 Feb 1987
309 citations
01 Mar 1987
TL;DR: The issue of interleaving semantics versus True concurrency in an algebraic setting is discussed.
Abstract: In this paper we discuss the issue of interleaving semantics versus True concurrency in an algebraic setting. We present various equivalence notions on Petri nets which can be used in the construction of algebraic models:
(a)
the occurrence net equivalence of Nielsen, Plotkin & Winskel;
(b)
bisimulation equivalence, which leads to a model which is isomorphic to the graph model of Baeten, Bergstra & Klop;
(c)
the concurrent bisimulation equivalence, which is also described by Nielsen & Thiagarajan, and Goltz;
(d)
partial order equivalences which are inspired by work of Pratt, and Boudol & Castellani.
306 citations
13 Jul 1998
TL;DR: This work shows counter-intuitive separations between seemingly related problems and proves the very surprising fact that boundedness is undecidable for Petri nets with Reset arcs.
Abstract: We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net model While Reachability is undecidable in all these extensions (indeed they are Turing-powerful), we exhibit unexpected frontiers for the decidability of Termination, Coverability, Boundedness and place-Boundedness In particular, we show counter-intuitive separations between seemingly related problems Our main theorem is the very surprising fact that boundedness is undecidable for Petri nets with Reset arcs
306 citations
TL;DR: In this paper, the authors consider workflows distributed over a number of organizations and consider the minimal requirements any interorganizational workflow should satisfy, and how to decide whether such a workflow is consistent with an interaction structure specified through a message sequence chart.
305 citations