Title :
E-timed Workflow Nets
Author :
Tiplea, Ferucio Laurentiu ; Macovei, Geanina Ionela
Author_Institution :
Dept. of Comput. Sci., "Al. I. Cuza" Univ. of Iasi
Abstract :
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
Keywords :
Petri nets; decidability; workflow management software; boundedness; decidability; e-timed Petri nets; e-timed workflow nets; liveness; soundness property; Computer science; Councils; Fires; Petri nets; Terminology;
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing, 2006. SYNASC '06. Eighth International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
0-7695-2740-X
DOI :
10.1109/SYNASC.2006.33