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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andersen, M., Gatten Larsen, H., Srba, J., Grund Sørensen, M., Haahr Taankvist, J.: Verification of liveness properties on closed timed-arc Petri nets. In: Kučera, A., Henzinger, T.A., Nešetřil, J., Vojnar, T., Antoš, D. (eds.) MEMICS 2012. LNCS, vol. 7721, pp. 69–81. Springer, Heidelberg (2013)
Bertolini, C., Liu, Z., Srba, J.: Verification of timed healthcare workflows using component timed-arc Petri nets. In: Weber, J., Perseil, I. (eds.) FHIES 2012. LNCS, vol. 7789, pp. 19–36. Springer, Heidelberg (2013)
Bolognesi, T., Lucidi, F., Trigila, S.: From timed Petri nets to timed LOTOS. In: PSTV 1990, pp. 1–14. North-Holland, Amsterdam (1990)
Christov, S.C., Avrunin, G.S., Clarke, A.L., Osterweil, L.J., Henneman, E.A.: A benchmark for evaluating software engineering techniques for improving medical processes. In: SEHC 2010, pp. 50–56. ACM (2010)
David, A., Jacobsen, L., Jacobsen, M., Jørgensen, K.Y., Møller, M.H., Srba, J.: TAPAAL 2.0: Integrated development environment for timed-arc Petri nets. In: Flanagan, C., König, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 492–497. Springer, Heidelberg (2012)
Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with distinct factors. American Journal of Mathematics 35, 413–422 (1913)
Du, Y., Jiang, C.: Towards a workflow model of real-time cooperative systems. In: Dong, J.S., Woodcock, J. (eds.) ICFEM 2003. LNCS, vol. 2885, pp. 452–470. Springer, Heidelberg (2003)
Flender, C., Freytag, T.: Visualizing the soundness of workflow nets. In: AWPN 2006, Department Informatics, University of Hamburg, vol. 267 (2006)
Hanisch, H.M.: Analysis of place/transition nets with timed-arcs and its application to batch process control. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol. 691, pp. 282–299. Springer, Heidelberg (1993)
Ling, S., Schmidt, H.: Time Petri nets for workflow modelling and analysis. In: SMC 2000, vol. 4, pp. 3039–3044. IEEE (2000)
Pelayo, F.L., Cuartero, F., Valero, V., Macia, H., Pelayo, M.L.: Applying timed-arc Petri nets to improve the performance of the MPEG-2 encoding algorithm. In: MMM 2004, pp. 49–56. IEEE (2004)
Sieverding, S., Ellen, C., Battram, P.: Sequence diagram test case specification and virtual integration analysis using timed-arc Petri nets. In: FESCA 2013. EPTCS, vol. 108, pp. 17–31 (2013)
Tiplea, F.L., Macovei, G.: Timed workflow nets. In: SYNASC 2005, pp. 361–366. IEEE Computer Society (2005)
Tiplea, F.L., Macovei, G.: E-timed workflow nets. In: SYNASC 2006, pp. 423–429. IEEE Computer Society (2006)
Tiplea, F.L., Macovei, G.: Soundness for s- and a-timed workflow nets is undecidable. IEEE Trans. on Systems, Man, and Cybernetics 39(4), 924–932 (2009)
van der Aalst, W.M.P.: Verification of workflow nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407–426. Springer, Heidelberg (1997)
van der Aalst, W.M.P.: The application of Petri nets to workflow management. Journal of Circuits, Systems, and Computers 8(1), 21–66 (1998)
van der Aalst, W.M.P., van Hee, K., ter Hofstede, A.H.M., Sidorova, N., Verbeek, H.M.W., Voorhoeve, M., Wynn, M.T.: Soundness of workflow nets: classification, decidability, and analysis. Formal Aspects of Comp. 23(3), 333–363 (2011)
Valero, V., Cuartero, F., de Frutos-Escrig, D.: On non-decidability of reachability for timed-arc Petri nets. In: PNPM 1999, pp. 188–196. IEEE (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mateo, J.A., Srba, J., Sørensen, M.G. (2014). Soundness of Timed-Arc Workflow Nets. In: Ciardo, G., Kindler, E. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2014. Lecture Notes in Computer Science, vol 8489. Springer, Cham. https://doi.org/10.1007/978-3-319-07734-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-07734-5_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07733-8
Online ISBN: 978-3-319-07734-5
eBook Packages: Computer ScienceComputer Science (R0)