Temporal inference of workflow systems based on time petri nets: Quantitative and qualitative analysis

Abstract

Recently, a significant body of research has been dedicated to the analysis and verification of workflows without taking into account the temporal dimension of activities involved. Workflow also has a strong temporal aspect: activity sequencing, deadlines, routing conditions, and scheduling all involve the element of time. Once the temporal aspects of the activities in a process description are taken into account, various types of synchronization anomalies and other undesirable behavior may be detected. In this article, we address both the quantitative temporal aspect and the qualitative temporal aspect of workflow systems. On one hand, based on time Petri net (TPN), we introduce a set of linear inference algorithms to solve some quantitative inference problems of temporal constraints of workflows. On the other hand, based on extended interval temporal logic (EITL), we propose temporal logic workflow models to qualitatively infer temporal relations among tasks of workflow systems. © 2004 Wiley Periodicals, Inc.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 10 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.