loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Conference on Application of Concurrency to System Design (ACSD 2007)
Testing the executability of scenarios in general inhibitor nets
Bratislava, Slovak Republic
July 10-July 13
ISBN: 0-7695-2902-X
ASCII Text
x 
 
Robert Lorenz, Sebastian Mauser, Robin Bergenthum, "Testing the executability of scenarios in general inhibitor nets," Application of Concurrency to System Design, International Conference on, pp. 167-176, Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ACSD.2007.73,
author = {Robert Lorenz and Sebastian Mauser and Robin Bergenthum},
title = {Testing the executability of scenarios in general inhibitor nets},
journal ={Application of Concurrency to System Design, International Conference on},
volume = {0},
year = {2007},
issn = {1550-4808},
pages = {167-176},
doi = {http://doi.ieeecomputersociety.org/10.1109/ACSD.2007.73},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Application of Concurrency to System Design, International Conference on
TI - Testing the executability of scenarios in general inhibitor nets
SN - 1550-4808
SP167
EP176
A1 - Robert Lorenz,
A1 - Sebastian Mauser,
A1 - Robin Bergenthum,
PY - 2007
KW - null
VL - 0
JA - Application of Concurrency to System Design, International Conference on
ER -
 
Robert Lorenz, Catholic University of Eichstatt-Ingolstadt, Germany
Sebastian Mauser, Catholic University of Eichstatt-Ingolstadt, Germany
Robin Bergenthum, Catholic University of Eichstatt-Ingolstadt, Germany
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.

Citation:
Robert Lorenz, Sebastian Mauser, Robin Bergenthum, "Testing the executability of scenarios in general inhibitor nets," acsd, pp.167-176, Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.