Back to Search
Start Over
Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics.
- Source :
- Fundamenta Informaticae; 2015, Vol. 140 Issue 1, p89-121, 33p
- Publication Year :
- 2015
-
Abstract
- Analysis of workflow processes with quantitative aspects like timing is of interest in numerous time-critical applications. We suggest a workflow model based on timed-arc Petri nets and study the foundational problems of soundness and strong (time-bounded) soundness. We first consider the discrete-time semantics (integer delays) and explore the decidability of the soundness problems and show, among others, that soundness is decidable for monotonic workflow nets while reachability is undecidable. For general timed-arc workflow nets soundness and strong soundness become undecidable, though we can design efficient verification algorithms for the subclass of bounded nets. We also discuss the soundness problem in the continuous-time semantics (real-number delays) and show that for nets with nonstrict guards (where the reachability question coincides for both semantics) the soundness checking problem does not in general follow the approach for the discrete semantics and different zone-based techniques are needed for introducing its decidability in the bounded case. Finally, we demonstrate the usability of our theory on the case studies of a Brake System Control Unit used in aircraft certification, the MPEG2 encoding algorithm, and a blood transfusion workflow. The implementation of the algorithms is freely available as a part of the model checker TAPAAL (www.tapaal.net). [ABSTRACT FROM AUTHOR]
- Subjects :
- WORKFLOW
CONTINUOUS time systems
SEMANTICS
DISCRETE systems
PETRI nets
Subjects
Details
- Language :
- English
- ISSN :
- 01692968
- Volume :
- 140
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Fundamenta Informaticae
- Publication Type :
- Academic Journal
- Accession number :
- 109269597
- Full Text :
- https://doi.org/10.3233/FI-2015-1246