<!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>Rule Based Business Process Compliance</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Guido Governatori</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sidney Shek</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>NICTA</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Australia</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>In this paper we report on the development and evaluation of a business process compliance checker, based on the compliance-by-design methodology proposed by Governatori and Sadiq [9]. For a screencast see http://www.youtube.com/watch?v=gFmDQJNai_4</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>Regulatory compliance is the set of activities an enterprise does to ensure that its core
business does not violate relevant regulations, in the jurisdictions in which the business
is situated, governing the (industry) sectors where the enterprise operates.</p>
      <p>
        The activities an organisation does to achieve its business objectives can be
understood as business processes, and consequently they can be represented by business
process models. On the other hand a normative document (e.g., a code, a bill, an act) can
be understood as a set of clauses, and these clauses can be represented in an
appropriate formal language. Based on this [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] proposed that business process compliance
is a relationship between the formal representation of a process model and the formal
representation of a relevant regulation.
      </p>
      <p>
        To gain compliance different strategies can be devised. [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] classifies approaches to
compliance as detective, corrective and preventative.
      </p>
      <p>Detective measures are intended to identify “after-the-fact” un-compliant situations.
There are two main approaches: (a) retrospective reporting through manual audits by
consultants or through IT forensics and Business Intelligence tools; (b) automated
detections generating audit reports against hard-coded checks performed on the requisite
system. Unlike the first approach, automated detection reduces the assessment time and
consequently also the time of un-compliance remediation/mitigation.</p>
      <p>Corrective measures are intended to limit the extent of any consequence caused by
un-compliant situations. For example, situations that can arise from the introduction of
a new norm impacting upon the business, to the organisation coming under surveillance
and scrutiny by a control authority or to an enforceable undertaking.</p>
      <p>
        The two approaches above suffer from lack of sustainability, caused by the extreme
interest of companies in continuous improvements of the quality of services, and for
changing legislations and compliance requirements. Indeed, even with automated
detection means, the hard coded checking of repositories can quickly grow to a very large
scale making it extremely difficult to evolve and maintain. To obviate these problem
[
        <xref ref-type="bibr" rid="ref13 ref17">17,13</xref>
        ] propose a preventative focus based on the idea of compliance-by-design.
      </p>
      <p>The key aspect of the compliance-by-design methodology is to supplement business
process models with additional information to ensure that a business process is
compliant with relevant normative frameworks before the deployment of the process itself.</p>
    </sec>
    <sec id="sec-2">
      <title>BPCC Architecture</title>
      <p>
        In this section we first introduce the architecture of BPCC, a business process
compliance checker based on the business process compliance methodology proposed by
Governatori and Sadiq [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>As we have already discussed to check whether a business process is compliant with
a relevant regulation, we need an annotated business process model and the formal
representation of the regulation. The annotations are attached to the tasks of the process,
and it can be used to record the data, resources and other information related to the single
tasks in a process.</p>
      <p>
        For the formal representation of the regulation we use FCL [
        <xref ref-type="bibr" rid="ref4 ref8">4,8</xref>
        ]. FCL is a simple,
efficient, flexible rule based logic. FCL has been obtained from the combination of
defeasible logic (for the efficient and natural treatment of exceptions, which are a common
feature in normative reasoning) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and a deontic logic of violations [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. In FCL a norm
is represented by a rule
      </p>
      <p>
        1, … ,   ⇒ 
Where  1, … ,   are the conditions of applicability of the norm/rule and  is the
normative effect of the norm/rule. FCL distinguishes two normative effects: the first is that
of introducing a definition for a new term. For example the rule
(), () &gt; 1000 ⇒ 
_()
specifies that, typically, a premium customer is a customer who has spent over 1000
dollars. The second normative effect is that of triggering obligations and other deontic
notions. The deontic notions covered by FCL are obligations1, permissions, and reparation
chains. For obligations FCL supports both maintenance obligations and achievement
obligations, and for achievement obligations both pre-emptive and non-pre-emptive
obligations (see [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] for full details). A reparation chair is an expression  1 1 ⊗  2 ⊗ ⋯ ⊗
    , where each   is an obligation, and each   is the content of the obligation
(modelled by a literal). The meaning of a reparation chain is that we have that  1 is obligatory,
but if the obligation of  1 is violated, i.e., we have ¬ 1, then the violation is
compensated by  2 (which is then obligatory). But if even  2 2 is violated, then this violation
is compensated by  3 which, after the violation of  2, becomes obligatory, and so on.
      </p>
      <p>It is worth noticing that FCL allows deontic expression (but not reparation chains)
to appear in the body of rules, thus we can have rules like:
, [P]
_ℎ ⇒ [OM]ℎ
_ ⊗ [OAPNP]
_.</p>
      <p>
        The rule above means that if a restaurant has a license to sell alcohol (i.e, it is permitted
to sell it, [P] _ℎ ), then it has a maintenance obligation to expose the license
([OM]ℎ _ ), if it does not then it has to pay the fine ([OAPNP] _ ). The
obligation to pay the fine is non-pre-emptive (this means it cannot be paid before the
violation). For full description of FCL and its feature see [
        <xref ref-type="bibr" rid="ref4 ref8">4,8</xref>
        ].
1 Note the obligations allow us to capture prohibitions; a prohibition is an obligation plus
negation, for example the prohibition to smoke can be understood as the obligation not to smoke.
      </p>
      <sec id="sec-2-1">
        <title>Compliance rule</title>
        <p>base &amp; checker
Legalese Formalisation Rule1</p>
        <sec id="sec-2-1-1">
          <title>Rule2</title>
        </sec>
        <sec id="sec-2-1-2">
          <title>Rule3</title>
        </sec>
        <sec id="sec-2-1-3">
          <title>Rule4</title>
        </sec>
        <sec id="sec-2-1-4">
          <title>Rule5</title>
        </sec>
        <sec id="sec-2-1-5">
          <title>Rule6</title>
        </sec>
        <sec id="sec-2-1-6">
          <title>Rule7</title>
        </sec>
        <sec id="sec-2-1-7">
          <title>Rule8</title>
        </sec>
        <sec id="sec-2-1-8">
          <title>Rule9</title>
          <p>...</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Compliance checker</title>
        <p>Input</p>
        <p>Obligations
tr
o
p
e
r
s
u
tt
a</p>
        <p>S</p>
        <p>Finally, FCL is agnostic about the nature of the literals it uses. They can represent
tasks (activities executed in a process) or propositions representing state variables.</p>
        <p>
          Compliance is not just about the tasks to be executed in a process but also on what the
tasks do, the way they change the data and the state of artifacts related to the process, and
the resources linked to the process. Accordingly, process models must be enriched with
such information. [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] proposes to enrich process models with semantic annotations.
Each task in a process model can have attached to it a set of semantic annotations. In our
approach the semantic annotations are literals in the language of FCL, representing the
effects of the tasks. The approach can be used to model business process data compliance
[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Recommendation sub-system</title>
        <p>Recommendations</p>
        <p>
          Figure 1 depicts the architecture of BPCC. Given an annotated process and the
formalisation of the relevant regulation, we can use the algorithm propose in [
          <xref ref-type="bibr" rid="ref7 ref8">7,8</xref>
          ] to
determine whether the annotated process model is compliant. The process runs as follows:
– Generate an execution trace of the process.
– Traverse the trace:
• for each task in the trace, cumulate the effects of the task using an update
semantics (i.e., if an effect in the current task conflicts with previous annotation,
update using the effects of the current tasks).
• use the set of cumulated effects to determine which obligations enter into force
at the current tasks. This is done by a call to an FCL reasoner.
• add the obligations obtained from the previous step to the set of obligations
carried over from the previous task.
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Logical state</title>
        <p>representation
Annotated
process model
s
i
s
y
l
a
n
a
ifta
h
W</p>
        <p>I*(e1)
I*(e2)
I*(e3)
I*(e4)
...</p>
        <sec id="sec-2-4-1">
          <title>T5 Post5</title>
        </sec>
        <sec id="sec-2-4-2">
          <title>T7 Post7</title>
        </sec>
        <sec id="sec-2-4-3">
          <title>T1 Post1</title>
        </sec>
        <sec id="sec-2-4-4">
          <title>T2 Post2</title>
        </sec>
        <sec id="sec-2-4-5">
          <title>T3 Post3</title>
        </sec>
        <sec id="sec-2-4-6">
          <title>T4 Post4</title>
        </sec>
        <sec id="sec-2-4-7">
          <title>T6 Post6</title>
          <p>• determine which obligations have been fulfilled, violated, or are pending; and
if there are violated obligation check whether they have been compensated.
– repeat for all traces.</p>
          <p>
            A process is compliant if and only if all traces are compliant (all obligations have been
fulfilled or if violated they have been compensated). A process is weakly compliant if
there is at least one trace that is compliant.
BPCC is implemented on top of Eclipse. For the representation of process models, it
uses the Eclipse Activiti BPMN 2.0 plugin, extended with features to allow users to add
semantic annotations to the tasks in the process model. BPCC is process model agnostic,
this means that while the current implementation is based on BPMN all BPCC needs is
to have a description of the process and the annotations for each task. A module of BPCC
take the description of the process and generates the execution traces corresponding to
the process. After the traces are generated, it implements the algorithm outlined in the
previous section, where it uses the SPINdle rule engine [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ] for the evaluation of the
FCL rules. In case a process is not compliant (or if it is only weakly compliant) BPCC
reports the traces, tasks, rules and obligations involved in the non compliance issues (see
Figure 4).
          </p>
          <p>BPCC was tested against an 2012 Australian Telecommunications Customers
Protection Code (C628-2012). The code is effective from September 1st 2012. The code
requires telecommunication operators to provide annual attestation of compliance with
the code staring from April 1st 2013. The evaluation was carried out in May-June 2012.
Specifically, the section of the code on complaint handling has been manually mapped
to FCL. The section of the code contains approximately 100 commas, in addition to
approximately 120 terms given in the Definitions and Interpretation section of the code.
The mapping resulted in 176 FCL rules, containing 223 FCL (atomic) propositions, and
7 instances of the superiority relation. Of the 176 rules 33 were used to capture
definitions of terms used in the remaining rules. Mapping the section of the code required all
features of FCL: all types of obligations apart punctual obligations were used,
reparation chains, permissions, defeasibility to easily capture exceptions, and obligations and
permissions in the body of rules.</p>
          <p>The evaluation was carried over in cooperation with an industry partner subject to the
code. The industry partner did not have formalised business processes. Thus, we worked
with domain experts from the industry partner (who had not been previously exposed to
BPM technology, but who were familiar with the industry code) to draw process models
for the activities covered by the code. The evaluation was carried out in two steps. In the
first part we modelled the processes they were. BPCC was able to identify several areas
where the existing processes were not compliant with the new code. In some cases the
industry partner was already aware of some of the areas requiring modifications of the
existing processes. However, some of the compliance issues discovered by the tools were
novel to the business analysts and were identified as genuine non-compliance issues that
need to be resolved. In the second part of the experiment, the existing processes were
modified to comply with the code based on the issues identified in the first phase. In
addition a few new business process models required by the new code were designed.
As result we generated and annotated 6 process models. 5 of the 6 models are limited
in size and they can be checked for compliance in seconds. The largest process contains
41 tasks, 12 decision points, xor splits, (11 binary, 1 ternary). The shortest path in the
model has 6 tasks, while the longest path consists of 33 tasks (with 2 loops), and the</p>
          <p>Fig. 4. BPCC report of traces, rules, and tasks responsible for non-compliance
longest path without loop is 22 task long. The time taken to verify compliance for this
process amounts approximately to 40 seconds on a MacBook Pro 2.2Ghz Intel Core i7
processor with 8GB of RAM (limited to 4GB in Eclipse).
4</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Conclusions</title>
      <p>
        We reported on the development of a tool, BPCC, for checking the compliance of
business processes with relevant regulations. The BPCC was successfully tested for real
industry scale compliance problems. In the recent years, a few other compliance
prototypes have been proposed: MoBuCom [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], Compass [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and SeaFlows [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. MoBuCom
and Compass are based on Linear Temporal Logic (LTL) and mostly they just address
“structural compliance” (i.e., that the tasks are executed in the relative order defined by
a constraint model). The use of LTL implies that the model on which these tools are
based on is not conceptual relative to the legal domain, and it fails to capture nuances of
reasoning with normative constrains such as violations, different types of obligations,
violations and their compensation. For example, obligations are represented by temporal
operators. This raises the problem of how to represent the distinction between
achievement and maintenance obligations. A possible solution is to use always for maintenance
and sometimes for achievement, but this leaves no room for the concept of permission
(the permission is dual of obligation, and always and sometimes are the dual of each
other). In addition using temporal operators to model obligations makes hard to capture
data compliance [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], i.e., obligations that refer to literals in the same task. SeaFlow
is based on first-order logic, and it is well know that first oder logic is not suitable to
capture normative reasoning [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. On the other hand FCL complies with the guidelines
set up in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] for a rule languages for the representation of legal knowledge and legal
reasoning.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgment</title>
      <p>NICTA is funded by the Australian Government as represented by the Department of
Broadband, Communications and the Digital Economy and the Australian Research
Council through the ICT Centre of Excellence program.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>G.</given-names>
            <surname>Antoniou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Billington</surname>
          </string-name>
          , G. Governatori, and
          <string-name>
            <given-names>M.J.</given-names>
            <surname>Maher</surname>
          </string-name>
          .
          <article-title>Representation results for defeasible logic</article-title>
          .
          <source>ACM Transactions on Computational Logic</source>
          ,
          <volume>2</volume>
          (
          <issue>2</issue>
          ):
          <fpage>255</fpage>
          -
          <lpage>287</lpage>
          ,
          <year>04 2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>A.</given-names>
            <surname>Elgammal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Türetken</surname>
          </string-name>
          , and W.-J. van den Heuvel.
          <article-title>Using patterns for the analysis and resolution of compliance violations</article-title>
          .
          <source>Int. J. Cooperative Inf. Syst.</source>
          ,
          <volume>21</volume>
          (
          <issue>1</issue>
          ):
          <fpage>31</fpage>
          -
          <lpage>54</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>T.F.</given-names>
            <surname>Gordon</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Governatori, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Rotolo</surname>
          </string-name>
          .
          <article-title>Rules and norms: Requirements for rule interchange languages in the legal domain</article-title>
          . In G. Governatori,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hall</surname>
          </string-name>
          , and
          <string-name>
            <surname>A</surname>
          </string-name>
          . Paschke, editors,
          <source>RuleML</source>
          <year>2009</year>
          , lNCS 5858, pp.
          <fpage>282</fpage>
          -
          <lpage>296</lpage>
          . Springer,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          .
          <article-title>Representing business contracts in RuleML</article-title>
          .
          <source>International Journal of Cooperative Information Systems</source>
          ,
          <volume>14</volume>
          (
          <issue>2-3</issue>
          ):
          <fpage>181</fpage>
          -
          <lpage>216</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Milosevic</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Sadiq</surname>
          </string-name>
          .
          <article-title>Compliance checking between business processes and business contracts</article-title>
          . In P.C..K. Hung, ed.,
          <source>EDOC</source>
          <year>2006</year>
          , pp.
          <fpage>221</fpage>
          -
          <lpage>232</lpage>
          . IEEE Computing Society,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Rotolo</surname>
          </string-name>
          .
          <article-title>Logic of violations: A Gentzen system for reasoning with contrary-to-duty obligations</article-title>
          .
          <source>Australasian Journal of Logic</source>
          <volume>4</volume>
          :
          <fpage>193</fpage>
          -
          <lpage>215</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          and
          <string-name>
            <given-names>Antonino</given-names>
            <surname>Rotolo</surname>
          </string-name>
          .
          <article-title>An algorithm for business process compliance</article-title>
          . In E. Francesconi,
          <string-name>
            <surname>G</surname>
          </string-name>
          , Sartor, and D. Tiscornia, eds,
          <source>Jurix</source>
          <year>2008</year>
          , pp.
          <fpage>186</fpage>
          -
          <lpage>191</lpage>
          . IOS Press,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Rotolo</surname>
          </string-name>
          .
          <article-title>A conceptually rich model of business process compliance</article-title>
          . In S. Link and
          <string-name>
            <surname>A</surname>
          </string-name>
          . Ghose, eds,
          <source>APCCM</source>
          <year>2010</year>
          , CRPIT 110, pp.
          <fpage>3</fpage>
          -
          <lpage>12</lpage>
          . ACS,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Sadiq</surname>
          </string-name>
          .
          <article-title>The journey to business process compliance</article-title>
          . In J. Cardoso and W. van der Aalst, eds, Handbook of Research on BPM, pp.
          <fpage>426</fpage>
          -
          <lpage>454</lpage>
          . IGI Global,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>M. Hashmi</surname>
            , G. Governatori, and
            <given-names>M. Thandar</given-names>
          </string-name>
          <string-name>
            <surname>Wynn</surname>
          </string-name>
          .
          <article-title>Business process data compliance</article-title>
          .
          <source>In RuleML</source>
          <year>2012</year>
          , LNCS 7438. Springer,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>H</given-names>
            <surname>Herrestad</surname>
          </string-name>
          .
          <article-title>Norms and formalization</article-title>
          .
          <source>In ICAIL 1991</source>
          , pp
          <fpage>175</fpage>
          -
          <lpage>184</lpage>
          . ACM,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>H</given-names>
            <surname>-.P. Lam</surname>
          </string-name>
          and
          <string-name>
            <surname>G. Governatori.</surname>
          </string-name>
          <article-title>The making of SPINdle</article-title>
          . In G. Governatori,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hall</surname>
          </string-name>
          , and
          <string-name>
            <surname>A</surname>
          </string-name>
          . Paschke, eds,
          <source>RuleML</source>
          <year>2009</year>
          , LNCS 5858, pp.
          <fpage>315</fpage>
          -
          <lpage>322</lpage>
          . Springer,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>R.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sadiq</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          .
          <article-title>Compliance aware business process design</article-title>
          . In
          <string-name>
            <surname>A.H.M. ter Hofstede</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Benatallah</surname>
          </string-name>
          , and H.-Y. Paik, eds,
          <source>BPD'07, LNCS 4928</source>
          , pp
          <fpage>120</fpage>
          -
          <lpage>131</lpage>
          . Springer,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. L.T. Ly,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rinderle-Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Göser</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Dadam</surname>
          </string-name>
          .
          <article-title>On enabling integrated process compliance with semantic constraints in process management systems - requirements, challenges, solutions</article-title>
          .
          <source>Information Systems Frontiers</source>
          ,
          <volume>14</volume>
          (
          <issue>2</issue>
          ):
          <fpage>195</fpage>
          -
          <lpage>219</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>F.M. Maggi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Montali</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Westergaard</surname>
            , and
            <given-names>W.M.P. van der Aalst. Monitoring</given-names>
          </string-name>
          <article-title>Business Constraints with Linear Temporal Logic: An Approach Based on Colored Automata</article-title>
          .
          <source>In BPM 2011, LNCS 6896</source>
          , pp.
          <fpage>132</fpage>
          -
          <lpage>147</lpage>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>S.</given-names>
            <surname>Sadiq</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          .
          <article-title>Managing regulatory compliance in business processes</article-title>
          . In J. van Brocke and M. Rosemann, eds,
          <source>Handbook of Business Process Management</source>
          , volume
          <volume>2</volume>
          , pp.
          <fpage>157</fpage>
          -
          <lpage>173</lpage>
          . Springer,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. S. Sadiq, G. Governatori, and
          <string-name>
            <given-names>K.</given-names>
            <surname>Naimiri</surname>
          </string-name>
          .
          <article-title>Modelling of control objectives for business process compliance</article-title>
          . In G. Alonso,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dadam</surname>
          </string-name>
          , and M. Rosemann, eds,
          <source>BPM</source>
          <year>2007</year>
          , LNCS 4714, pp.
          <fpage>149</fpage>
          -
          <lpage>164</lpage>
          . Springer,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>