History-dependent Petri nets

  • Authors:

  • Kees Van Hee;Alexander Serebrenik;Natalia Sidorova;Wil Van Der Aalst

  • Affiliations:

  • Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands

  • Venue:
  • ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.