Testing the executability of scenarios in general inhibitor nets

Authors:
Robert Lorenz;Sebastian Mauser;Robin Bergenthum
Affiliations:
Catholic University of Eichstatt-Ingolstadt, Germany;Catholic University of Eichstatt-Ingolstadt, Germany;Catholic University of Eichstatt-Ingolstadt, Germany
Venue:
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Year:
2007

Citing 0
Cited 5

Complete Process Semantics of Petri Nets

Fundamenta Informaticae
Executability of scenarios in Petri nets

Theoretical Computer Science
Complete process semantics for inhibitor nets

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Complete Process Semantics of Petri Nets

Fundamenta Informaticae
Faster verification of partially ordered runs in petri nets using compact tokenflows

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

In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a polynomial algorithm to decide, whether a scenario given by an LSO is an execution of a given PTI-net. The algorithm is based on an equivalent characterization of enabled LSOs called token flow property. Although the definition of the token flow property involves exponentially many objects in the size of the LSO, there is a nontrivial transformation into a flow optimization problem which can be solved in polynomial time.