Uniform verification of workflow soundness

Transactions of the Institute of Measurement and Control

Volumn 33, Issue 1, 2011, Pages 133-148

  Barkaoui, Kamel ^a   Ben Ayed, Rahma ^b  

^a Bioinformatique et Chimie Moléculaire   (France)

^b UNIVERSITY OF TUNIS EL MANAR   (Tunisia)

Author keywords

soundness; structure theory of Petri nets; uniform verification; workflow nets

Indexed keywords

COMPUTATION THEORY; GRID COMPUTING; PETRI NETS; WEB SERVICES;

COLLABORATIVE ACTIVITIES; COMPLEX SYNCHRONIZATION; MODELLING CONTROLS; RESOURCE ALLOCATION CONSTRAINTS; SOUNDNESS; STRUCTURE THEORY; WEB SERVICE APPLICATIONS; WORKFLOW NETS;

AGILE MANUFACTURING SYSTEMS;

EID: 79952023917     PISSN: 01423312     EISSN: None     Source Type: Journal    
DOI: 10.1177/0142331208095676     Document Type: Article

References (12)

1. Barkaoui, K. and Minoux, M. 1992: A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets. ICATPN 92, LNCS, 616, 62-75.
2. Barkaoui, K. and Petrucci, L. 1998: Structural analysis of workflow nets with shared resources. Proceedings of Workflow Management: Net-based Concepts, Models, Techniques and Tools (WFM?8), Lisbon, June; Computing Science Reports, Eidhoven University of Technology, 98/7, 82-95.
3. Barkaoui, K. and Peyre, J.F. 1996: On liveness and controlled siphons in Petri nets. ICATPN, 96, LNCS, 1091.
4. Barkaoui, K., Couvreur, J.M. and Dutheillet, C. 1995: On liveness in extended non self-controlling nets. ICATPN 1995, LNCS, 935, 25-44.
5. Barkaoui, K., Couvreur, J.M. and Klai, K. 2005: On the equivalence between liveness and deadlock-freeness in Petri nets. ICATPN 05, LNCS, 3536.
6. Esparza, J. and Silva, M. 1992: A polynomial-time algorithm to decide liveness of bounded free choice nets. Theoritical Computer Science, 102, 85-205.
7. Kemper, K. and Bause, F. 1992: An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets. ICATPN 92, LNCS, 616.
8. Tiplea, F.L. and Marinescu, D.C. 2005: Structural soundness of workflow nets is decidable. Information Processing Letters, 96, 54-58.
9. van der Aalst, W.M.P. 1997: Verification of workflow nets. ICATPN 97, LNCS, 1248.
10. van der Aalst, W.M.P. 2000: Workflow verification: finding control-flow errors using Petri-net based techniques. Business Process Management, LNCS 1806 161-83.
11. van Hee, K., Sidorova, N. and Voorhoeve, M. 2004: Generalized soundness of workflow nets is decidable. ICATPN 04, LNCS, 3099.
12. van Hee, K., Sidorova, N. and Voorhoeve, M. 2005: Resource-constrained workflow nets. Fundamenta Informatica, 1-15.