Achieving a general, formal and decidable approach to the OR-join in workflow using Reset nets

Lecture Notes in Computer Science

Volumn 3536, Issue , 2005, Pages 423-443

  Wynn, Moe Thandar ^a   Edmond, David ^a   Van Der Aalst, W M P ^a,b   Ter Hofstede, A H M ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

OR join; Petri nets; Reset nets; Synchronizing merge; Workflow patterns; YAWL

Indexed keywords

ALGORITHMS; SEMANTICS; SYNCHRONIZATION;

RESET NETS; WORKFLOW LANGUAGE YAWL;

PETRI NETS;

EID: 26444598543     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11494744_24     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, J. Desel, and E. Kindler. On the Semantics of EPCs: A Vicious Circle. In M. Rump and F.J. Nüttgens, editors, Proceedings of the EPK 2002: Business Process Management using EPCs, pages 71-80, Trier, Germany, 2002. Gesellschaft für Informatik, Bonn.
3. W.M.P. van der Aalst and A.H.M ter Hofstede. YAWL: Yet Another Workflow Language. Information Systems, 30(4):245-275, June 2005.
4. W.M.P van der Aalst, A.H.M ter Hofstede, B.Kiepuszewski, and A.P.Barros. Workflow Patterns. Distributed and Parallel Databases, 14:5-51, 2003.
5. P.A. Abdulla, K. Cerans, B. Jonsson, and Y.-K. Tsay. General decidability theorems for infinite-state systems. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (27-30 July), pages 313-321, New Brunswick, NJ, July 1996. IEEE Computer Society.
6. P. Darondeau. Unbounded Petri net Synthesis. In J. Desel, W. Reisig, and G. Rozenberg, editors, Lectures on Concurrency and Petri Nets, Advances in Petri Nets, volume 3098 of Lecture Notes in Computer Science, pages 413-428, Eichstätt,Germany, 2003. Springer-Verlag.
7. C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset Nets Between Decidability and Undecidability. In K. Larsen, S. Skyum, and G. Winskel, editors, Proceedings of the 25th International Colloquium on Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science, pages 103-115, Aalborg, Denmark, July 1998. Springer-Verlag.
8. C. Dufourd, P. Jančar, and Ph. Schnoebelen. Boundedness of Reset P/T Nets. In J. Wiedermann, P. van Emde Boas, and M. Nielsen, editors, Lectures on Concurrency and Petri Nets, volume 1644 of Lecture Notes in Computer Science, pages 301-310, Prague, Czech Republic, July 1999. Springer-Verlag.
9. Eastman Software. RouteBuilder Tool User's Guide. Eastman Software, Inc, Billerica, MA, USA, 1998.
10. A. Finkel, J.-F. Raskin, M. Samuelides, and L. van Begin. Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. Electronic Notes in Theoretical Computer Science, 68(6): 1-22, 2002.
11. A. Finkel and Ph. Schnoebelen. Fundamental Structures in Well-Structured Infinite Transition Systems. In C.L. Lucchesi and A.V. Moura, editors, Theoretical Informatics: Third Latin American Symposium, Campinas, LATIN'98 (20 - 24 April), volume 1380 of Lecture Notes in Computer Science, pages 102-118, Campinas, Brazil, 1998. Springer-Verlag.
12. A. Finkel and Ph. Schnoebelen. Well-structured Transition Systems everywhere! Theoretical Computer Science, 256(1-2):63-92, April 2001.
13. S. Jablonski and C. Bussler. Workflow Management: Modeling Concepts, Architecture, and Implementation. International Thomson Computer Press, London, UK, 1996.
14. B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows. Phd thesis, Queensland University of Technology, Brisbane, Australia, 2003.
15. E. Kindler. On the Semantics of EPCs: A Framework for Resolving the Vicious Circle. In J. Desel, B. Pernici, and M. Weske, editors, Proceedings of 2nd International Conference on Business Process Management, volume 3080 of Lecture Notes in Computer Science, pages 82-97, Potsdam, Germany, 2004. Springer-Verlag.
16. M. Leuschel and H. Lehmann. Coverability of Reset Petri Nets and other Well-Structured Transition Systems by Partial Deduction. In J. Lloyd et al., editors, Proceedings of Computational Logic 2000, volume 1861 of Lecture Notes in Artificial Intelligence, pages 101-115, London, UK, 2000. Springer-Verlag.
17. F. Leymann and D. Roller. Production Workflow: Concepts and Techniques. Prentice-Hall PTR, Upper Saddle River, New Jersey, USA, 1999.
18. P. Rittgen. Modified EPCs and their Formal Semantics. Technical Report 99/19, Institute of Information Systems, University Koblenz-Landau, Koblenz, Germany, 1999.
19. A. Yakovlev, M. Kishinevsky, A. Kondratyev, L. Lavagno, and M. Pietkiewicz-Koutny. On the Models for Asynchronous Circuit Behaviour with OR Causality. Formal Methods in System Design, 9(3): 189-233, 1996.