History-Dependent Petri Nets

Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails. We consider processes that not only keep track of their history in a log, but also make decisions based on this log. To model such processes we extend the basic Petri net framework with the notion of history and add guards to transitions evaluated on the process history. We show that some classes of history-dependent nets can be automatically converted to classical Petri nets for analysis purposes. These classes are characterized by the form of the guards (e.g., LTL guards) and sometimes the additional requirement that the underlying classical Petri net is either bounded or has finite synchronization distances.

[1]  Antoni Mazurkiewicz,et al.  CONCUR '97: Concurrency Theory , 1997, Lecture Notes in Computer Science.

[2]  Marco Bernardo,et al.  Formal Methods for Mobile Computing, 5th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-Moby 2005, Bertinoro, Italy, April 26-30, 2005, Advanced Lectures , 2005, SFM.

[3]  Tadao Kasami,et al.  Three measures for synchronic dependence in Petri nets , 1983, Acta Informatica.

[4]  Rüdiger Valk.  On the Computational Power of Extended Petri Nets , 1978, MFCS.

[5]  Tadao Murata,et al.  B-Fairness and Structural B-Fairness in Petri Net Models of Concurrent Systems , 1992, J. Comput. Syst. Sci..

[6]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[7]  Kurt Lautenbach,et al.  Elements of General Net Theory , 1979, Advanced Course: Net Theory and Applications.

[8]  Wolfgang Reisig,et al.  Weighted Synchronic Distances , 1981, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[9]  R. J. Nelson,et al.  Introduction to Automata , 1968 .

[10]  Wolfgang Reisig,et al.  The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..

[11]  Dimitra Giannakopoulou,et al.  Automata-based verification of temporal properties on running programs , 2001, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001).

[12]  Lutz Priese,et al.  Algebraic Characterization of Petri Net Pomset Semantics , 1997, CONCUR.

[13]  Marco Pistore,et al.  History-Dependent Automata: An Introduction , 2005, SFM.

[14]  Jay L. Gischer,et al.  The Equational Theory of Pomsets , 1988, Theor. Comput. Sci..

[15]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[16]  G. Michele Pinna,et al.  Domain and event structure semantics for Petri nets with read and inhibitor arcs , 2004, Theor. Comput. Sci..

[17]  Raymond R. Devillers,et al.  Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..

[18]  J. Winkowski,et al.  Mathematical Foundations of Computer Science 1978 , 1978, Lecture Notes in Computer Science.

[19]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[20]  Vaughan R. Pratt,et al.  Some Constructions for Order-Theoretic Models of Concurrency , 1985, Logic of Programs.

[21]  Kees M. van Hee,et al.  LogLogics: A logic for history-dependent business processes , 2007, Sci. Comput. Program..

[22]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[23]  Kurt Jensen,et al.  Coloured Petri Nets: Modelling and Validation of Concurrent Systems , 2009 .

[24]  Wolfgang Reisig,et al.  Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets , 1980 .