DocumentCode
3107330
Title
Testing the executability of scenarios in general inhibitor nets
Author
Lorenz, Robert ; Mauser, S. ; Bergenthum, R.
Author_Institution
Catholic Univ. of Eichstatt-Ingolstadt, Eichstatt
fYear
2007
fDate
10-13 July 2007
Firstpage
167
Lastpage
176
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.
Keywords
Petri nets; computational complexity; concurrency control; formal specification; optimisation; PTI-net; Petri nets; flow optimization problem; general inhibitor nets; labeled stratified order structures; polynomial algorithm; polynomial time; token flow property; weighted inhibitor arcs; Computer science; Concurrent computing; Inhibitors; Petri nets; Polynomials; Power system modeling; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Application of Concurrency to System Design, 2007. ACSD 2007. Seventh International Conference on
Conference_Location
Bratislava
ISSN
1550-4808
Print_ISBN
0-7695-2902-X
Type
conf
DOI
10.1109/ACSD.2007.73
Filename
4276276
Link To Document