<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Enabling Time-Aware Process Support with the ATAPIS Toolset?</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Databases and Information Systems, Ulm University</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The proper handling of temporal constraints is crucial for business processes in many application domains. Contemporary processaware information systems (PAIS), however, lack a sophisticated support of time-aware processes. First of all, at design time it should be possible to specify the temporal constraints of a business process. In turn, this should be accompanied by checking the respective time-aware process schema for inconsistencies that may emerge due to hidden interdependencies among the temporal constraints. The latter is crucial to enable a robust and error-free execution of the time-aware process schema. At run time, corresponding process instances need to be monitored for violations of their temporal constraints. This demo paper presents the ATAPIS Toolset for modeling and enacting time-aware processes. The toolset is based on AristaFlow BPM Suite-an industrial-strength process management system. The ATAPIS Toolset enables process engineers to correctly specify and implement time-aware processes. Further, time-aware process instances can be efficiently executed, whilst monitoring their temporal constraints. Altogether, the ATAPIS Toolset covers the temporal perspective of processes at design as well as run time in a comprehensive way.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Time is a crucial factor regarding business process support [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In many
application domains (e.g., patient treatment, automotive engineering) the proper
handling of temporal constraints is vital in order to successfully execute and
complete processes [
        <xref ref-type="bibr" rid="ref2 ref5 ref8">2,5,8</xref>
        ]. Contemporary process-aware information systems (PAIS),
however, lack a sophisticated support of time-aware processes [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. To remedy this
drawback, the proper integration of temporal constraints with both the design
and run-time components of a PAIS has been identified as a key challenge in the
development of next generation process management technology [
        <xref ref-type="bibr" rid="ref2 ref5 ref7">2,5,7</xref>
        ].
      </p>
      <p>The toolset presented in this demonstration has been developed in the
ATAPIS project. The major goal of this project is to provide a comprehensive
framework enabling the specification, enactment and monitoring of time-aware
processes in adaptive PAIS. The ATAPIS Toolset1 allows specifying time-aware
? Copyright c 2014 for this paper by its authors. Copying permitted for private and
academic purposes.
1 A screencast is available on dbis.info/atapis.
process schemas as well as checking their temporal consistency at design time.
Furthermore, at run time, related time-aware process instances may be created,
executed, and continuously checked for temporal constraint violations.</p>
      <p>
        The components presented in this tool demonstration allow modeling
temporal constraints as first class citizens of a process schema. In particular, the
toolset covers most of the time patterns introduced in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Empirical evidence
from case studies has confirmed that these patterns are required for modeling the
temporal perspective of processes in a variety of domains. Furthermore, the demo
shows how the ATAPIS Toolset enables soundness and consistency checks of
time-aware process schemas to guarantee for a robust and correct process instance
execution. Finally, different notions of temporal consistency (e.g., weak / dynamic
consistency, controllability) are supported. Note that a discussion on further
related work is omitted for lack of space. Interested readers are refereed to [
        <xref ref-type="bibr" rid="ref7 ref8">8,7</xref>
        ].
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>The ATAPIS Toolset</title>
      <p>
        The ATAPIS Toolset is implemented based on the AristaFlow BPM Suite, an
industrial-strength process management system that exploits advanced process
support features we developed in previous research projects [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In particular,
AristaFlow provides an open API in combination with a modular, service-oriented
system design [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The latter allows us to extend AristaFlow with functions
required for the specification and execution of time-aware processes.
2.1
      </p>
      <p>
        Specifying Time-Aware Process Schemas
Fig. 1 depicts the process editor of the ATAPIS Toolset. It is based on the
AristaFlow Process Template Editor, which we enhance with capabilities and
language elements required to capture and implement fundamental time
patterns [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Currently, the ATAPIS Toolset covers the following time patterns: Time
Lags between two activities (TP1), Durations (TP2), Fixed Date Elements (TP4),
Schedule Restricted Elements (TP5), Time-Dependent Variability (TP8), and
Cyclic Elements (TP9).
      </p>
      <p>
        In order to enable time lags between two activities (TP1) and cyclic elements
(TP9) we extend AristaFlow’s process modeling language [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] with time edges.
In the process editor, such a time edge between two activities is visualized by
a dashed line (cf. Fig. 1). In accordance with TP1, a time edge may be added
between arbitrary activities that can be conjointly executed in the context of a
process instance (i.e., a time edge must not be added between activities from
exclusive branches). Furthermore, a time edge is configured in respect to the
represented restriction (i.e., minimum and/or maximum time distance) and the
kind of time lag (i.e., start-start, start-end, end-start, or end-end). The concrete
configuration settings are reflected by a label attached to the time edge; e.g., the
label E[0h, 2h]S which is attached to the time edge between activities prepare
patient and perform treatment (cf. Fig. 1), describes a time lag with a
minimum time distance of 0 hours and a maximum time distance of 2 hours between
the end (E) of the former activity and the start (S) of the latter.
      </p>
      <p>Time Edge
Activity Duration</p>
      <p>Fixed Date Element</p>
      <p>
        Properties Editor
In turn, time patterns restricting a particular activity (or the process) (i.e.,
Duration, Fixed Date Element, and Schedule Restricted Element) may be
configured with the corresponding properties editor. In Fig. 1, for example, activity
prepare treatment is selected and the properties editor is shown in the lower
part. In the upper section of this editor, the duration of the activity must be
specified. In ATAPIS, durations are specified through three values [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], which
can be interpreted as follows: usually, activity durations are contingent, i.e., it is
possible to set up a duration range for any activity, the contingent minimum and
maximum duration, however, the PAIS becomes aware of the effective activity
duration only after its completion. Hence, the duration must not be restricted by
the PAIS. In practice, however, activity durations usually represent worst case
estimates; i.e., most durations may be restricted to some extend; we call this the
flexible maximum duration. For better usability, the duration of the activity is
visualized on the right side section of the properties editor.
      </p>
      <p>In the lower section of the properties editor (cf. Fig. 1), two fixed date elements
are specified for activity perform treatment. The one restricting the earliest
start date of the activity retrieves its value from data element date. In turn, the
fixed date element restricting the latest start date is set relatively to (i.e., 30
minutes after) the one on the earliest start date of the activity.</p>
      <p>
        Similarly a schedule restricted element may be specified for any activity. In
turn, this constraint is based on a language for representing collections of temporal
intervals [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] (e.g., formula [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1-5</xref>
        ]/days:during:weeks represents the first 5 days of
each week; i.e., Monday–Friday).
      </p>
      <p>
        Time Model View
A time-aware process schema is enacted by performing its activities in the specified
order, while obeying the specified temporal constraints. Generally, a time-aware
process schema is denoted as temporally consistent if it is possible to perform
all execution paths without violating the temporal constraints involved [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Note
that temporal consistency of a time-aware process schema and its instances
constitutes a fundamental prerequisite for a robust and error-free execution [
        <xref ref-type="bibr" rid="ref1 ref5">1,5</xref>
        ].
For any PAIS supporting time-aware processes, therefore, a crucial task is to
check temporal consistency of the process schema at design time as well as to
monitor and ensure temporal consistency of process instances during run time.
This is challenging since temporal constraints might interact with each other
resulting in complex (hidden) interdependencies. For example, assume that a
time lag is added between activities prepare patient and inform patient in
the process schema depicted in Fig. 1 (cf. Fig. 2). Assume further that the time
lag specifies that activity prepare patient must be completed at least one hour
before inform patient may be started. In this scenario, —although not directly
obvious—the process schema can never be enacted without violating at least one
of its constraints, i.e., the process schema is temporally inconsistent (cf. Fig. 2).
      </p>
      <p>
        To check whether a particular process schema is temporally consistent,
ATAPIS maps it to a specific time model (cf. Fig. 2). The latter allows us to capture
the complex interdependencies between constraints, which are not explicit in
process models. To support various consistency notions, the ATAPIS Toolset provides
different implementations of the time model; e.g., using conditional simple
temporal networks [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] to check for weak or dynamic consistency or conditional simple
temporal networks with uncertainty [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] to check for dynamic controllability—a
more restricted form of temporal consistency. Particularly, we choose these models
since they allow us to exploit and reuse correct and sound checking algorithms
for well founded models representing temporal constraints.
      </p>
      <p>When analyzing the temporal perspective of a process schema one may also
view the corresponding time model including any hidden temporal constraints
resulting from interdependencies of the specified temporal constraints (cf. Fig. 2).
To support a thorough analysis of the temporal perspective of a process schema
(e.g., to analyze the impact of a particular date for a fixed date element), we
additionally provide editing capabilities for these time models.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Conclusion</title>
      <p>The demonstration presents the ATAPIS Toolset and its components. It allows
creating time-aware process schemas based on a well-founded modeling language.
Further, it allows checking time-aware process schemas for temporal consistency
in order to ensure their executability. We are currently investigating the impact
of process change operations on time-aware processes and are implementing them
in ATAPIS. Further, we are integrating temporal features with the run-time
environment of the AristaFlow BPM Suite.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bettini</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>X.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jajodia</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Temporal reasoning in workflow systems</article-title>
          .
          <source>Distrib Para Dat</source>
          <volume>11</volume>
          (
          <issue>3</issue>
          ),
          <fpage>269</fpage>
          -
          <lpage>306</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Combi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gozzi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Posenato</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozzi</surname>
          </string-name>
          , G.:
          <article-title>Conceptual modeling of flexible temporal workflows</article-title>
          .
          <source>TAAS</source>
          <volume>7</volume>
          (
          <issue>2</issue>
          ),
          <volume>19</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>19</lpage>
          :
          <fpage>29</fpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Combi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hunsberger</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Posenato</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>An algorithm for checking the dynamic controllability of a conditional simple temporal network with uncertainty</article-title>
          .
          <source>In: Proc ICAART'13</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Dadam</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The ADEPT project: A decade of research and development for robust and flexible process support - challenges and achievements</article-title>
          .
          <source>Computer Science - R&amp;D</source>
          <volume>22</volume>
          (
          <issue>2</issue>
          ),
          <fpage>81</fpage>
          -
          <lpage>97</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Eder</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Euthimios</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pozewaunig</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rabinovich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Time management in workflow systems</article-title>
          .
          <source>In: Proc BIS'99</source>
          . pp.
          <fpage>265</fpage>
          -
          <lpage>280</lpage>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Lanz</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kreher</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dadam</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Enabling process support for advanced applications with the AristaFlow BPM Suite</article-title>
          .
          <source>In: Proc BPM'10 Demo</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Lanz</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Posenato</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Combi</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Controllability of time-aware processes at run time</article-title>
          .
          <source>In: Proc CoopIS'13</source>
          . pp.
          <fpage>39</fpage>
          -
          <lpage>56</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lanz</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Time patterns for process-aware information systems</article-title>
          .
          <source>Req Eng</source>
          <volume>19</volume>
          (
          <issue>2</issue>
          ),
          <fpage>113</fpage>
          -
          <lpage>141</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Leban</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McDonald</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Forster</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>A representation for collections of temporal intervals</article-title>
          .
          <source>In: Proc AAAI'86</source>
          . pp.
          <fpage>367</fpage>
          -
          <lpage>371</lpage>
          (
          <year>1986</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Reichert</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dadam</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>ADEPTflex - supporting dynamic changes of workflows without losing control</article-title>
          .
          <source>J Intell Inf Syst</source>
          <volume>10</volume>
          (
          <issue>2</issue>
          ),
          <fpage>93</fpage>
          -
          <lpage>129</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Tsamardinos</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vidal</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pollack</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>CTP: A new constraint-based formalism for conditional, temporal planning</article-title>
          .
          <source>Constraints</source>
          <volume>8</volume>
          (
          <issue>4</issue>
          ),
          <fpage>365</fpage>
          -
          <lpage>388</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>