loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'06)
E-timed Workflow Nets
Timisoara, Romania
September 26-September 29
ISBN: 0-7695-2740-X
ASCII Text
x 
 
Ferucio Laurentiu Tiplea, Geanina Ionela Macovei, "E-timed Workflow Nets," Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on, pp. 423-429, Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/SYNASC.2006.33,
author = {Ferucio Laurentiu Tiplea and Geanina Ionela Macovei},
title = {E-timed Workflow Nets},
journal ={Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on},
volume = {0},
year = {2006},
isbn = {0-7695-2740-X},
pages = {423-429},
doi = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2006.33},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
TI - E-timed Workflow Nets
SN - 0-7695-2740-X
SP423
EP429
A1 - Ferucio Laurentiu Tiplea,
A1 - Geanina Ionela Macovei,
PY - 2006
KW - null
VL - 0
JA - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
ER -
 
Ferucio Laurentiu Tiplea, "Al. I. Cuza" University of Iasi, Romania
Geanina Ionela Macovei, Iasi County Council, Romania
In this paper, E-Timed Workflow Nets are introduced, and a characterization of the soundness property for them is provided. This characterization is based on boundedness and liveness as for classical workflow nets. It is shown that the properties of boundedness and liveness for E-timed Petri nets can be reduced to the same properties for Petri nets with zero-tests on bounded places. As these two properties are decidable for Petri nets with zero-tests on bounded places, the soundness property for E-timed workflow nets is decidable.
Citation:
Ferucio Laurentiu Tiplea, Geanina Ionela Macovei, "E-timed Workflow Nets," synasc, pp.423-429, Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.