Verifying generalized soundness of workflow nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4378 LNCS, Issue , 2007, Pages 235-247

  Van Hee, Kees ^a   Oanea, Olivia ^a   Sidorova, Natalia ^a   Voorhoeve, Marc ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Petri nets; Soundness; Verification; Workflows

Indexed keywords

DECISION THEORY; NUMBER THEORY; PETRI NETS; SOFTWARE PROTOTYPING; VERIFICATION;

SOUNDNESS; WORKFLOWS;

DATA FLOW ANALYSIS;

EID: 38049174648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70881-0_21     Document Type: Conference Paper

References (19)

1. W. M. P. van der Aalst. The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers, 8(1):21-66, 1998.
2. W. M. P. van der Aalst and K. M. van Hee. Workflow Management: Models, Methods, and Systems. MIT Press, 2002.
3. R. Bagnara, P. Hill, and E. Zaffanela. The Parma Polyhedra Library users manual. Department of Mathematics, University of Parma,Italy. www.cs.unipr.it/ppl/Documentation.
4. R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill. Possibly not closed convex polyhedra and the Parma Polyhedra Library. In SAS, volume 2477 of LNCS, pages 213-229, 2002.
5. G. Berthelot. Verification de Reseaux de Petri. PhD thesis, Universite Pierre et Marie Curie (Paris), 1978.
6. F. Commoner. Deadlocks in Petri Nets. Applied Data Research, Inc., Wakefield, Massachusetts, Report CA-7206-2311, 1972.
7. D. de Frutos Escrig and C. Johnen. Decidability of home space property. Technical report, Univ. de Paris-Sud, Centre d'Orsay, Laboratoire de Recherche en Informatique Report LRI-503, July 1989.
8. J. Desel and J. Esparza. Free Choice Petri nets., volume 40 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1995.
9. K. van Hee, N. Sidorova, and M. Voorhoeve. Soundness and separability of workflow nets in the stepwise refinement approach. In Proc. of ICATPN'2003, volume 2679 of LNCS, pages 337-356, 2003.
10. K. van Hee, N. Sidorova, and M. Voorhoeve. Generalized soundness of workflow nets is decidable. In Proc. of ICATPN'2004, volume 3099 of LNCS, pages 197-216, 2004.
11. E. W. Mayr. An algorithm for the general Petri net reachability problem. In Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computation, STOC'1981, pages 238-246. ACM, 1981.
12. T. Murata. Petri nets: Properties, analysis and applications. In Proceedings of the IEEE, volume 7(4), pages 541-580, 1989.
13. L. Ping, H. Hao, and L. Jian. On 1-soundness and soundness of workflow nets. In Third Workshop on Modelling of Objects, Components, and Agents Aarhus, Denmark, October 11-13, 2004, pages 21-36, 2004.
14. R. Post. YASPER Petri net editor. Department of Mathematics and Computer Science, Technical University Eindhoven, The Netherlands, www.yasper.org.
15. C. Reutenauer. The mathematics of Petri nets. Prentice-Hall, Inc., 1990.
16. A. Schrijver. Theory of Linear and Integer Programming. Wiley-Interscience series in discrete mathematics. John Wiley & Sons, 1986.
17. F. Tiplea and D. Marinescu. Structural soundness for workflow nets is decidable. Information Processing Letters, 96(2):54-58, 2005.
18. W. Vogler. Behaviour preserving refinement of Petri nets. In WG, volume 246 of LNCS, pages 82-93. Springer, 1986.
19. W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets, volume 625 of LNCS. Springer-Verlag, 1992.