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 explore the decidability of these 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. 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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 35th International Conference on Application and Theory of Petri Nets and Concurrency (ICATPN'14) |
Number of pages | 20 |
Volume | 8489 |
Publisher | Springer Publishing Company |
Publication date | 2014 |
Pages | 51-70 |
ISBN (Print) | 978-3-319-07733-8 |
ISBN (Electronic) | 978-3-319-07734-5 |
DOIs | |
Publication status | Published - 2014 |
Event | 35th International Conference on Application and Theory of Petri Nets and Concurrency - Tunis, Tunisia Duration: 23 Jun 2014 → 27 Jun 2014 Conference number: 35 |
Conference
Conference | 35th International Conference on Application and Theory of Petri Nets and Concurrency |
---|---|
Number | 35 |
Country/Territory | Tunisia |
City | Tunis |
Period | 23/06/2014 → 27/06/2014 |
Series | Lecture Notes in Computer Science (LNCS) |
---|---|
ISSN | 0302-9743 |