On persistent reachability in Petri nets

Authors:
Kamila Barylska;ŁUkasz Mikulski;Edward Ochmanski
Affiliations:
Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Chopina 12/18, 87-100 Toruń, Poland;Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Chopina 12/18, 87-100 Toruń, Poland and School of Computing Science, Newcastle University, Newcastle upon Tyne, NE ...;Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Chopina 12/18, 87-100 Toruń, Poland and Institute of Computer Science, Polish Academy of Sciences, Jana Kazimierza ...
Venue:
Information and Computation
Year:
2013

Citing 11
Cited 2

The mathematics of Petri nets

The mathematics of Petri nets
Properties of Conflict-Free and Persistent Petri Nets

Journal of the ACM (JACM)
Self-Modifying Nets, a Natural Extension of Petri Nets

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Place or Transition Petri Nets

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Computation: finite and infinite machines

Computation: finite and infinite machines
Decomposition Theorems for Bounded Persistent Petri Nets

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
A Note on Persistent Petri Nets

Concurrency, Graphs and Models
Parallel program schemata

Journal of Computer and System Sciences
Separability in persistent petri nets

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets

Step persistence in the design of GALS systems

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
A taxonomy of persistent and nonviolent steps

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of persistency, based on the rule ''no action can disable another one'' is one of the classical notions in concurrency theory. In this paper, we deal with arbitrary place/transition nets, but concentrate on their persistent computations. It leads to an interesting decision problem: Is a given marking reachable with a persistent run? In order to study the persistent-reachability problem we define a class of nets, called nonviolence nets. We show that inhibitor nets can be simulated by the nonviolence nets (and vice versa), thus the latter are computationally Turing powerful and reachability and coverability problems are undecidable in the class of the nonviolence nets.