Token History Petri Nets

• Autorzy: van Hee K. , Serebrenik A. , Sidorova N.
• Języki publikacji: EN

Abstrakty

EN

State of the art information system commonly record events in log files, also known as audit trails. Moreover, business processes often go beyond the sole recording the events and base decisions on the events observed in the past. To model such processes we extend the basic Petri net framework with the notion of history by associating tokens with histories, adding guards evaluated on the history to the transitions and mapping arcs to expressions involving histories. Guards and arc expressions can involve data associated with the transitions.

Słowa kluczowe

EN

Petri net

• Wydawca: Polskie Towarzystwo Matematyczne
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2008
• Tom: Vol. 85, nr 1-4
• Strony: 219--234
• Opis fizyczny: bibliogr. 19 poz.

Twórcy

autor

van Hee K.

autor

Serebrenik A.

autor

Sidorova N.

• Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB Eindhoven, The Netherlands,

Bibliografia

• [1] CPN Tools. http://wiki.daimi.au.dk/cpntools/cpntools.wiki.
• [2] W. M. P. van der Aalst and K. M. van Hee. Workflow Management: Models, Methods, and Systems. MIT Press, 2002.
• [3] W. M. P. van der Aalst, A. H. M. ter Hofstede, B. Kiepuszewski, and A. P. Barros. Workflow patterns. Distributed and Parallel Databases, 14(1):5-51, 2003.
• [4] P. Baldan, N. Busi, A. Corradini, and G. M. Pinna. Domain and event structure semantics for Petri nets with read and inhibitor arcs. Theoretical Computer Science, 323(1-3):129-189, 2004.
• [5] E. Best and R. R. Devillers. Sequential and concurrent behaviour in Petri net theory. Theoretical Computer Science, 55(1):87-136, 1987.
• [6] E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Trans. Program. Lang. Syst., 16(5):1512-1542, 1994.
• [7] P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, pages 238-252, 1977.
• [8] M. B. Dwyer, G. S. Avrunin, and J. C. Corbett. Patterns in property specifications for finite-state verification. In ICSE '99, pages 411-420. IEEE Computer Society Press, 1999.
• [9] J. L. Gischer. The equational theory of pomsets. Theoretical Computer Science, 61:199-224, 1988.
• [10] U. Goltz and W. Reisig. The non-sequential behavior of Petri nets. Information and Control, 57(2/3):125-147, 1983.
• [11] K. M. van Hee, R. D. J. Post, J. M. E. M. van der Werf, N. Sidorova, and J. Keiren. Designing case handling systems. In Proceedings of the International Workshop on Petri Nets and Software Engineering, 2007.
• [12] K. M. van Hee, A. Serebrenik, N. Sidorova, and W. M. P. van der Aalst. History-dependent Petri nets. In J. Kleijn and A. Yakovlev, editors, ICATPN, LNCS, pages 164-183. Springer, 2007.
• [13] K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Monographs in Theoretical Computer Science. Springer-Verlag, 1997.
• [14] U.Montanari andM. Pistore. History-dependent automata: An introduction. InM. Bernardo and A. Bogliolo, editors, SFM, volume 3465 of LNCS, pages 1-28. Springer, 2005.
• [15] V. R. Pratt. Some constructions for order-theoretic models of concurrency. In R. Parikh, editor, Logic of Programs, volume 193 of LNCS, pages 269-283. Springer, 1985.
• [16] W. Reisig. Petri Nets: An Introduction, volume 4 of Monographs in Theoretical Computer Science. An EATCS Series. Springer, 1985.
• [17] W. Reisig and G. Rozenberg, editors. Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets, held in Dagstuhl, September 1996, volume 1491 of LNCS. Springer, 1998.
• [18] H. Wimmel and L. Priese. Algebraic characterization of Petri net pomset semantics. In A. W. Mazurkiewicz and J. Winkowski, editors, CONCUR, volume 1243 of LNCS, pages 406-420. Springer, 1997.
• [19] G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Advances in Petri Nets,volume 255 of LNCS, pages 325-392. Springer, 1986.