Using Timed Automata for a Priori Warnings and Planning for Timed Declarative Process Models

Many processes are characterized by high variability, making traditional process modeling languages cumbersome or even impossible to be used for their description. This is especially true in cooperative environments relying heavily on human knowledge. Declarative languages, like Declare, alleviate this issue by not describing what to do step-by-step but by defining a set of constraints between actions that must not be violated during the process execution. Furthermore, in modern cooperative business, time is of utmost importance. Therefore, declarative process models should be able to take this dimension into consideration. Timed Declare has already previously been introduced to monitor temporal constraints at runtime, but it has until now only been possible to provide an alert when a constraint has already been violated without the possibility of foreseeing and avoiding such violations. In this paper, we introduce an extended version of Timed Declare with a formal timed semantics for the entire language....

[1]  Johann Eder,et al.  Time Constraints in Workflow Systems , 1999, CAiSE.

[2]  Marco Montali Specification and Verification of Declarative Open Interaction Models: A Logic-Based Approach , 2010 .

[3]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[4]  Carlo Combi,et al.  Conceptual modeling of flexible temporal workflows , 2012, TAAS.

[5]  Federico Chesani,et al.  Verification of Choreographies During Execution Using the Reactive Event Calculus , 2008, WS-FM.

[6]  Johann Eder,et al.  Time Constraints in Workflow Systems , 2013, Seminal Contributions to Information Systems Engineering.

[7]  Johann Eder,et al.  Temporal Consistency of View Based Interorganizational Workflows , 2008, UNISCON.

[8]  Michael Westergaard,et al.  CPN Tools 4: Multi-formalism and Extensibility , 2013, Petri Nets.

[9]  Wil M. P. van der Aalst,et al.  Declarative workflows: Balancing between flexibility and support , 2009, Computer Science - Research and Development.

[10]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[11]  Maria E. Orlowska,et al.  On Modeling and Verification of Temporal Constraints in Production Workflows , 1999, Knowledge and Information Systems.

[12]  Sushil Jajodia,et al.  Solving multi-granularity temporal constraint networks , 2002, Artif. Intell..

[13]  Hamdy A. Taha,et al.  Operations research: an introduction / Hamdy A. Taha , 1982 .

[14]  Grigore Rosu,et al.  Monitoring Algorithms for Metric Temporal Logic Specifications , 2004, RV@ETAPS.

[15]  Martin Leucker,et al.  Comparing LTL Semantics for Runtime Verification , 2010, J. Log. Comput..

[16]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[17]  Jinjun Chen,et al.  Adaptive selection of necessary and sufficient checkpoints for dynamic verification of temporal constraints in grid workflow systems , 2007, TAAS.

[18]  Fabrizio Maria Maggi,et al.  Looking into the Future. Using Timed Automata to Provide a Priori Advice about Timed Declarative Process Models , 2012, OTM Conferences.

[19]  Manfred Reichert,et al.  Workflow Time Patterns for Process-Aware Information Systems , 2010, BMMDS/EMMSAD.

[20]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[21]  Sushil Jajodia,et al.  Temporal Reasoning in Workflow Systems , 2002, Distributed and Parallel Databases.

[22]  David L. Dill,et al.  Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.

[23]  Michael Westergaard,et al.  Better Algorithms for Analyzing and Enacting Declarative Workflow Languages Using LTL , 2011, BPM.

[24]  Fabrizio Maria Maggi,et al.  Declare: A Tool Suite for Declarative Workflow Modeling and Enactment , 2011, BPM.