Time Constraints in Workflow Net Theory (Teza de doctorat)
-----------------------------------
          
ABSTRACT
-----------------------------------
In the thesis there are discussed two main time extensions 
of workflow nets. Four types of timed workflow nets are 
introduced, L, E, S, and A, each of them based on the 
corresponding type of timed Petri net. The soundness
property is studied for each type of them. 
In case of  L- and E-timed workflow nets, the soundness 
property is equivalent with boundedness and liveness properties 
of their closures, which are L- and E-timed Petri nets, 
respectively. Boundedness and liveness properties for 
L-timed Petri nets can be reduced to the same properties 
for classical Petri nets.
Petri nets with zero tests on bounded places are introduced and
boundedness and liveness of E-timed Petri nets are reduced to the
same properties of Petri nets with zero tests on bounded places.
The soundness property for S- and A-timed workflow nets is studied
through the halting problem of deterministic counter machines:
deterministic counter machine can be simulated by S- and A-timed
workflow nets and the halting problem of deterministic counter 
machines can be reduce to the quasi-liveness property of S- and 
A-timed workflow nets.
As a conclusion, our thesis closes the decidability status of the
soundness problem for timed workflow nets with discrete time
durations based on L-, E-, S-, and A-timed Petri nets.
          
SPEAKER(S)
-----------------------------------
Geanina MACOVEI
Consiliul Judetean Iasi
Iasi
Romania
-----------------------------------
Geanina Ionela Macovei graduated the Faculty of Computer Science,
"Alexandru Ioan Cuza" University of Iasi, in 1995. 
From 1997 she is a programmer at Iasi County Council.
-----------------------------------