<!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>Learn the rules so you know how to break them properly</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Matteo Baldoni</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Cristina Baroglio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Elisa Marengo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Viviana Patti</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Federico Capuzzimati</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>( ) Apparently attributed to Tenzin Gyatso</institution>
          ,
          <addr-line>14th Dalai Lama, The 18 Rules For Living, Rule</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universita` degli Studi di Torino</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>-Commitment-based protocols are receiving increas- abstracting from operational details, allow a flexible specing attention as tools for the representation of business interaction ification of business intents and relationships that involve in open MAS. As recent proposals, like 2CL, show when the real- autonomous and heterogeneous parties. This alternative is, for ittryadt oitiboenaml ocdoemlemdiitsmcehnatr-bacatseerdizpedrobtoycaolhs,igwhhdicehgraececoofunretgounlalytiofonr, instance, investigated in [1], which proposes a commitmentthe constitutive specification of actions, are to be enriched with a based approach to the representation of cross-organizational regulative specification. This is the case of the measures foreseen business models by identifying a set of reusable and composby the Markets in Financial Instruments Directive, aimed at able patterns. Such patterns are designed so as to be employed fostering the creation of an integrated financial market within by business analysts in the development of business models tahdeeEcularroapteivaen cUonmiomni.tmThenist-wboarsekdshaopwprsotahcehubseyfualpnpelsysinogf aidtotpotitnhge for desired scenarios. MiFID case study. We developed an extension of Winikoff et al.'s Recent proposals, like [5], [6], enrich commitment proenhanced commitment machine, that accounts of 2CL temporal tocols with temporal regulations. In particular, [5] proposes regulations. It allows the analysis of business protocols and, in a decoupled approach that separates a constitutive and a particular, of the possible violations. regulative specification [7]. A clear separation brings about many advantages, mostly as a consequence of the obtained I. INTRODUCTION modularity: easier re-use of actions, easier customization, easier composition. Roughly speaking, constitutive rules, by identifying certain behaviors as foundational of a certain type of activity, create that activity. They do so by specifying the semantics of actions. Regulative rules contingently constrain a previously constituted activity. In other words, they rule the “flow of activity”, by capturing some important characteristics of how things should be carried on in specific contexts of interaction [8]. This work shows how to use the proposal in [5] to represent and analyze business protocols. We implemented an extension of Winikoff et al.'s commitment machine [9] that can be used to identify potential risks and violations of temporal regulations and of commitments, to foresee the impact on the business protocols of changes in the regulations, and decide about possible regimentation/enforcement policies. Moreover, we applied this tool to a real world case study, the MiFID directive by the European Union, which regulates the interaction of banks, clients, and financial intermediaries in the task of buying/selling financial products. Such parties are characterized by autonomy and heterogeneity, and it is fundamental to define each party's responsibilities in the interaction. Section II introduces the case study. Section II-A explains the challenges involved by it. Section III presents the formal model. Section III-A discusses violations. Section IV presents the MiFID model and analyses execution graphs. Conclusions end the paper.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Business processes often involve autonomous partners with
heterogeneous software designs and implementations. In this
context, there is the need of identifying high-level abstractions
that allow modeling them in a natural way. Moreover, in
many practical contexts (like banking) there is the need to
integrate in such processes specific regulations that constrain
the interaction. In order to minimize the effort needed to
define proper interfaces and to minimize the altering of
internal implementations, Telang and Singh [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] propose that
such abstractions should capture the contractual relationships
among the partners. Existing approaches (e.g. BPEL,
WSCDL) rely on the specification of control and business flows,
imposing unnecessarily restrictive orderings of the message
exchanges but do not supply the means for capturing the
business relationships nor the business intent. This limitation
is highlighted also by authors like Pesic and van der Aalst
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], who, in particular, show the advantages of adopting
a declarative rather than a procedural representation. In other
words, existing approaches are characterized by high rigidity
and are not suitable to naturally represent decisional processes
and responsibilities, which are two key elements in the
definition of business activities. Rigidity is counter-productive
when tackling unexpected or exceptional situations, while the
lack in accounting of responsibilities does not support the
identification of causes to failures and possible violations.
      </p>
      <p>
        One possible alternative is to rely on commitment-based
approaches [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], that are well-known in the Multi-Agent
Systems research area for modeling interaction. Commitments,
      </p>
    </sec>
    <sec id="sec-2">
      <title>II. THE MIFID CASE STUDY</title>
      <p>
        The Markets in Financial Instruments Directive (MiFID
for short) is the directive number 2004/39/EC [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], issued
by the European Commission within the Financial Services
      </p>
      <p>Action Plan, and represents a fundamental step in the creation
of an integrated and harmonized financial market within the
European Union. Specifically, MiFID specifies values and
principles that all the countries will have to follow as well as
corresponding implementative measures. One of the main
concerns of the directive is the protection of the clients of financial
service agencies, thereby it introduces new regulations that
financial services must follow so as to guarantee the position
of the investor. Three categories of clients are identified, with
increasing knowledge about financial products. For each of
them, it specifies informative and protective obligations to
which the financial operator is bound. For instance,
intermediaries are expected to collect information about his/her
clients, with the help of detailed tests. Each country in the
European Union implements European directives in ways that
are customized to its specific structures and organization. In
Italy, the adjustment of the market regulation to the MiFID
principles and implementative measures is up to two actors:
Consob (Commissione Nazionale per le Societa` e la Borsa)
and Banca d’Italia.</p>
      <p>
        One of the main characteristics of MiFID is a great attention
to clients. At any moment, the intermediary must guarantee the
investor the control of the contractual relation for all aspects
ranging from the proposed financial products to the strategies
that will be enacted to obtain the most beneficial results for the
client. Therefore, MiFID imposes strong constraints to
investment companies, and gives investors the tools for legally acting
against those intermediaries who do not comply to them. The
case study we use in this proposal concerns the regulation that
applies to the offer of investment services off-site. This case
study is already used in the literature [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and, in particular,
by the ICT4LAW project (http://www.ict4law.org). This is, for
instance, the case when a bank promotes and sells financial
products with the help of external collaborators (called “tied
agents” or intermediaries). The proposal of products and the
definition of a contract must comply to a set of constraints:
      </p>
    </sec>
    <sec id="sec-3">
      <title>Identification: the client must be identified by an identity</title>
      <p>card or equivalent document;
Qualification: the intermediary supplies all the foreseen
documentation about his/her professional qualification
and the rules that he/she must stick to;
Profiling: the intermediary must profile the client,
gathering information about the balance sheet, knowledge about
financial subjects, investment aims. This phase requires
the filling the MiFID form, which explicitly specifies the
resulting category of client and which is to be signed also
by the client;
Selection: the proposed financial products must agree
with the client’s profile. This requires that financial
products are classified w.r.t. the different client profiles;
Evaluation: the proposal is evaluated through a
simulation: if it is adequate an order is filled and signed both by
the client and by the intermediary, otherwise the product
is discarded;
Verification: the documentation is sent to the investment
trust, which must check that there are no errors or missing
data. In this case, the documentation is corrected and
sent back to the intermediary, otherwise the contract is
stamped and sent to the client.</p>
      <p>Withdrawal: The client can decide to cancel an order.</p>
      <p>Due to the high degree of regulation imposed by the
directive, an intermediary can incur into many forms of violations.
For instance, when the mandate contract is stipulated, the
client should receive a signed copy of it. By this contract
the client commissions the intermediary to use some financial
holdings so as to achieve some investment goals. One common
violation, that occurs in this phase, is that the intermediary
does not give to the client copy of the documentation foreseen
by the qualification phase. Another common violation is that
often intermediaries do not ask their clients to sign the MiFID
form for the definition of the client’s profile. The motivation
behind both these behaviors is that intermediaries believe that
a great amount of documents to sign will refrain clients from
stipulating contracts and will even compel them to consult
some competitor. Indeed, investors tend to be unwilling to
study in depth the proposed products, and often prefer to have
just an overall idea. A third kind of violation, with similar
motivations, amounts to the proposal of a financial products
that does not agree with the client’s profile, without an explicit
and formalized agreement with the client.</p>
      <sec id="sec-3-1">
        <title>A. Challenges</title>
        <p>
          What happens if, despite these violations, an intermediary
buys a financial product for the client? Even though, standing
to MiFID, the intermediary did not fulfill all of his/her
obligations, the sale is valid, the client results to be the owner
of the product. This happens because MiFID does not define
sales (sales are defined by a different regulation) but dictates
how the interaction with the client should be carried on by
adding a new layer of regulations on top of existing ones. So,
the violation of some constraint does not affect the sale directly
but creates both a risk of sanction and an exposure risk for
the intermediary. This is witnessed by a sentence by the Italian
Supreme Court (Cassazione civile a sezioni unite, num. 26724
and 26725 [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]) which decided that in case of violations, like
the above, if the client was economically damaged he/she
can ask for a compensation and, in the most serious cases,
for the cancellation of the contract between the client and
the intermediary. So, if the investment turns out to be a bad
investment, the client can arraign the intermediary before the
court.
        </p>
        <p>
          These observations show the importance of putting the
business analyst in condition to study the possible violations,
in the context of a regulation, with the aim of identifying
the risks the interaction could encounter. The evaluation of
such risks will allow the definition of operational strategies
which can, alternatively, prevent the occurrence of violations
(regimentation) or implement alerting mechanisms
(enforcement) [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. The choice depends on various factors, tied to the
nature of violations and to the context. As explained by Sergot
[
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], it is impossible to realize a complete regimentation that
prevents all possible violations. Even when regimentation were
applicable its implementation could be expensive, also in the
sense that it may require a long time to be realized.
        </p>
        <p>In particular, the MiFID case study underlines the need
of adopting a representation model that accommodates both
a constitutive and a regulative specification. MiFID is
designed for regulating interactions of clients, intermediaries,
and financial trusts (regulative specification) that involve the
exertion of powers, like that of sale or of profiling, which
constitute the reality in which the three parties interact
(constitutive specification). Part of these powers (like profiling a
client) are defined inside the directive itself, part (like sale)
are recognized but pre-exist the regulation. The latter are
particularly delicate because, since they already exist before
the new regulation is defined, it is not possible to constrain
their execution, e.g., by adding preconditions of executability.
As the sentence by the Supreme Court that we cited shows, the
violation of a constraint, posed by MiFID, does not invalidate
a sale. Depending on the kind of violation that occurred, the
ownership of the financial product will remain of the client
or it will be transfered to the intermediary, but this will be
transparent to the seller, who will not be involved in the quarrel
and will have no consequences (specifically he/she will not
have to give money back). These observations underline the
need of adopting a modular representation that accounts for
both specifications.</p>
        <p>Another important remark is that in many practical contexts,
the MiFID case is one of them, the business relationship
captured by a regulation should be kept as flexible as possible, in
order to allow the interacting parties, who are heterogeneous,
autonomous, and basically self-interested entities, to find the
way of interacting that better suits their characteristics and
needs. In other words, any interaction that does not violate
the constraints should be allowed. Flexibility is important to
allow the business partners to profit of opportunities or to make
the most efficient use of their time that is possible. As an
intuitive example, let us consider the case of financial products
classification. What MiFID requires is that financial products
are classified according to the types of client profiles. It does
not say when this classification should be done. A business
process that imposes that classification must be done in the
evaluation phase surely respects the directive, however, it
precludes the possibility to classify products in those moments
when the intermediary is free and have them ready when a
client arrives.</p>
        <p>
          Most of the approaches specify business processes as
procedures, that implement a selection of some of the possible
execution paths. Even though in this way the resulting business
process will comply to the directive, it will also implement
further restrictions to the interaction that the directive does not
impose. Commitment-based representations, instead, offer the
degree of flexibility requested in these cases because they can
capture the intent of a business relationship [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], avoiding the
imposition of unnecessary constraints. What we additionally
need to represent in a regulation like MiFID is the capability
to express temporal relations (e.g. that the execution of a
purchase must occur only after the client was profiled) in a
way that is as flexible as basic commitment protocols are.
Last but not the least, the commitments that the interacting
parties have towards the others are objectively inferable from
their observable behavior, thanks to the social semantics of the
commitment approach.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>III. MODULAR BUSINESS PROTOCOLS</title>
      <p>
        In this work we adopt a representation of the business
protocol, i.e. of the specification of how the business interaction
should be carried out, based on commitments. In particular, we
adopt the approach discussed in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], that features an explicit
distinction between a constitutive and a regulative
specification. The former defines the protocol actions, while the latter
encodes a set of temporal constraints. Both specifications are
defined based on commitments. Commitments are directed
from a debtor to a creditor. The notation C(x; y; r; p) denotes
that agent x commits to an agent y to bring about consequent
condition p when the antecedent condition r holds. When r
equals true, we use the short notation C(x; y; p). The business
partners share a social state that contains commitments and
other literals that are relevant to their interaction. Every
partner can affect the social state by executing actions, whose
definition is given in terms of operations onto the social state,
see [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. The partners’ behavior is affected by commitments,
which have a regulative nature, in that debtors should act in
accordance with the commitments they have taken.
      </p>
      <p>Definition 1 (Business protocol): A business protocol P is
a tuple hRo; F; A; Ci, where Ro is a set of roles, identifying
the interacting parties, F is a set of literals (including
commitments) that can occur in the social state, A is a set of actions,
and C is a set of constraints.</p>
      <p>The set of social actions A, defined on F and on Ro, forms
the constitutive specification of the protocol, while the set
of constraints C, defined on F and on Ro too, forms the
regulative specification of the protocol. We assume that facts
persist in the social state, they denote observations about
events that occurred.</p>
      <p>
        Constitutive specification. The constitutive specification of
actions is given by defining their meaning in terms of how they
affect the social state. The specification follows the grammar
below, where the means construct amounts to a counts-as
relation [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]:
      </p>
      <p>A ! (Action means Operation if Cond)+
Action ! protocolAction
Operation ! Op(commitment) j f act j</p>
      <p>Operation ^ Operation
Op ! CREATE j DELETE j RELEASE j DELEGATE j</p>
      <p>ASSIGN j ...</p>
      <p>Cond ! literal j Cond ^ Cond j Cond _ Cond j</p>
      <p>
        Cond XOR Cond
where protocolAction is the name of an action of the protocol;
Cond specifies the context in which the counts-as relation
holds; Op is one of the operations on commitments;
commitment is a commitment of form C(x; y; r; p) (see [15, page
neg.
A 6 . B
executions which satisfy the constraints of interest. The work
in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] introduces a LTL semantics for the 2CL operators, that
formalizes the intuitive semantics that we reported in Table I.
      </p>
      <sec id="sec-4-1">
        <title>A. Detecting violations</title>
        <p>Meaning
If A occurs, B must hold at
least once afterwards (or in the
same state). It does not matter
if B already held before A.</p>
        <p>If A holds, B cannot hold in
the same state or after.</p>
        <p>B cannot hold until A becomes
true. Afterwards, it is not
necessary that B becomes true.</p>
        <p>In case B becomes true, A
cannot hold beforehand.</p>
        <p>It is the conjunction of the base
response and base before
relations: A . B and A . B.</p>
        <p>It is the conjunction of the base
response and base before
negative relations: A 6 . B and</p>
        <p>A 6 . B.</p>
        <p>pos. A . B The interaction of a set of parties will be compliant to a
busiBefore ness protocol when all the commitments they have towards the
neg. A 6 . B others, and that are objectively inferable from their observable
behavior, are satisfied (as usual in the social approach), and
pos. A . B the overall execution respects all the constraints. Intuitively,
Cause the addition of a regulative specification by means of 2CL
neg. A 6 . B constraints restricts the set of acceptable executions.</p>
        <p>
          Some approaches to commitment protocols propose an
operational semantics that relies on commitment machines
to specify and execute protocols [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ],
        </p>
        <p>
          TABLE I some others, like [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], use interaction diagrams, operationally
2CL OPERATORS AND THEIR MEANING. specifying commitments as an abstract data type, and
analyzing the commitment’s life cycle as a trajectory in a suitable
space. Other approaches rely on temporal logics to give a
formal semantics to commitments and to the protocols defined
49]), where x and y are roles in Ro and r and p are formulas upon them. Among these, [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] uses DLTL, while [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ], [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]
in disjunctive normal form of propositional literals in F ; fact adopt extensions of CTL*. Given the specification of a set
is a positive or negative proposition that does not concern of social actions, all these approaches allow the inference of
commitments and which contributes to the social state (they those executions, which are legal with respect to the protocol.
are the conditions that are brought about); and literal can In particular, commitment machines [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] (later refined in
be either a commitment or a positive or negative proposition [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]) specify the possible states of an execution, the actions
(where negation means that a certain literal does not hold in that are used for doing the transitions, and the possible final
the social state) states of the protocol. The meaning associated with each state
Regulative specification. The regulative specification is ex- specifies which commitments are active in that state, and the
pressed in 2CL [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. This language allows the designer meaning associated with each action defines how the
committo express many kinds of constraints describing the legal ments are affected by the action, leading to a state change.
evolutions of the social state. As underlined in [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], Intuitively, commitment machines allow the formalization of
constraint-based declarative representations provide abstrac- legal executions by taking into account only the constitutive
tions which allow to explicitly capture what is mandatory and specification of the social actions.
what is forbidden, without the need to express the set of possi- 2CL allows the expression of temporal constraints on
ble executions extensionally. For this reason, protocols remain execution paths. Since commitment machines express legal
compact improving flexibility: they specify what is desired and execution paths, temporal constraints can be used to restrict
undesired, leaving all that remains unconstrained. This is an this set. A natural choice for formalizing such constraints
advantage with respect to procedural approaches, characterized is Linear Temporal Logic (LTL) [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. This kind of logic
by a prescriptive nature which requires the specification of allows the identification of those executions which satisfy the
all the allowed evolutions. It also accommodates naturally to constraints of interest. In [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] it is possible to find a LTL
the commitment-based approach, where a central issue is the semantics for the operators of 2CL.
respect of the agents’ autonomy. 2CL follows the grammar: A legal execution of a commitment-based protocol, enriched
        </p>
        <p>
          C ! (Cond op Cond) tbhyatmiesanasccoefpt2eCdLbyregtuhleaticvoemsmpeitcmifiecnattiomnasc,hiisneanbueixletcuutpioonn
C, see Def. 1, is a set of constraints of the form A op B, the constitutive specification of the protocol, and that, when
where A and B are formulas of literals and op is one of interpreted as a linear temporal model, satisfies the LTL
the operators supplied by the language. The complete list of formulas corresponding to the regulative specification of the
possible operators is fully described in [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. Table I reports protocol. Based on this characterization, it is possible to
only those that are used in the case study. 2CL allows the provide mechanisms for verifying that an agent is behaving
expression of temporal constraints on execution paths. Since in respectance to the protocol. When this does not happen, we
commitment machines express legal execution paths, temporal can say that a violation has occurred. So, if in a
commitmentconstraints can be used to restrict this set. A natural choice for based protocol, made only of the constitutive specification
formalizing such constraints is Linear Temporal Logic (LTL) of actions, violations are detected only when a commitment
[
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. This kind of logic allows the identification of those remains unsatisfied in a final state, in our proposal, we also
detect violations during the execution, violation amounting to
the fact that a constraint is not respected.
        </p>
        <p>
          We implemented an extension of Winikoff et al.’s enhanced
commitment machine [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] by introducing an automated
verification of constraints. This extended commitment machine
allows exploring all the possible executions of a business
protocol, showing the regulative violations, i.e. both those
states in which some constraint is violated and those states
that contain unsatisfied commitments. The implementation is
done in tuProlog1 and the software interprets a 2CL business
process specification by means of a parser written in Java. The
implementation is available at the URL http://www.di.unito.it/
alice/2CL.
        </p>
        <p>The output of the commitment machine will be an annotated
and colored graph of all the possible interactions (it is a
reachability graph). The graph includes all the interactions that
are possible, considering only the constitutive specification of
the actions. The annotation, highlighted by graphical
conventions, accounts for all the regulative aspects, concerning both
commitments and constraints. So the graph will include both
legal states and states in which violations occur. Part of
violations related to a state are, actually, just potential, depending
on future behavior. Tendentiously they become violations if
the interaction stops in that state. As usual in commitment
protocols interaction can, in fact, start/end in any state. In this
case, highlighting the possible violations, therefore, amounts
to alerting the user about a risk. More generally, the obtained
graph is a tool that supports the analysis of a business protocol,
by helping the identification of situations where it maybe
necessary to perform some regimentation or enforcement.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>IV. MODELING MIFID</title>
      <p>Let us begin this section by introducing the business
protocol of the sales of financial products as they used to be
before the MiFID directive. The specification will include
just a set of constitutive rules defining the necessary actions.
No particular constrain is imposed to regulate the interaction.
Afterwards, we will see how it is possible to introduce the
MiFID specification, in a way that is modular w.r.t. the
preMiFID one. The resulting business protocol will include new
constitutive rules, aimed at specifying those activities that
were introduced by the directive (like the profiling), and a
set of regulative rules. Such rules tie the activities of a basic
sale to those foreseen by the directive. In particular, that an
intermediary, who committed to take care of an investment
supplies the necessary documentation, and that this as well as
the classification of the possible products happen before the
proposal of an adequate solution. The regulative constraints
will implement this connection without the need of modifying
the specification of the sales actions.</p>
      <p>Pre-MiFID sale business protocol. This business
protocol foresees an initial state containing a commitment,
C(f p; inv; invested), from the intermediary to the investor
to find a good investment. The actions involve three parties:</p>
    </sec>
    <sec id="sec-6">
      <title>1http://www.alice.unibo.it/xwiki/bin/view/Tuprolog/</title>
      <p>an investor (inv), an intermediary (the financial promoter
f p), and a bank (bank). The action propose solution presents
a selected financial product to the investor. The proposal
is characterized by a risk level, and can be rejected
(reject proposal) or accepted (sign order). In the first case, the
commitment of the intermediary is released. When the order
is signed, the investor commits to the bank to respect the
purchase contract (C(inv; bank; contract ended)). The bank
is expected to send a copy of the contract to the investor
by the action send contract, which creates a commitment
C(bank; inv; executed order) from the bank to the investor
to actually execute the order. When the bank sends copy of
the contract to the investor, the initial commitment of the
intermediary is discharged. The natural end of the contract
is captured by the action end which causes the discharge of
the pending commitments of the investor and of the bank.
(a) propose solution means proposed RiskL</p>
      <p>if :proposed RiskL ^ :rejected proposal.
(b) reject proposal means rejected proposal,</p>
      <p>RELEASE(C(fp, inv, invested))
if :accepted proposal ^ proposed RiskL ^ :rejected proposal.
(c) sign order means CREATE(C(inv, bank, contract ended)),
accepted proposal, order signed
if :order signed ^ proposed RiskL ^ :rejected proposal.
(d) send contract means CREATE(C(bank, inv, executed order)),
invested, contract sent
if :contract sent ^ order signed.
(e) end means executed order, contract ended
if contract sent ^ :contract ended ^ :contract abort.</p>
      <p>Figure 1 shows the graph of the possible executions for this
protocol. For reducing the complexity of the graph and make it
readable we added a few preconditions to avoid the depiction
of those paths where a same action is repeated. The same is
done also with the graphs for MiFID.</p>
      <p>Introduction of MiFID. This directive introduces new
regulations that financial services must follow in their interaction
with the client, so as to protect the investor. Its
application requires the enrichment of the business protocol with
new, specific actions, aimed at: identifying the investor and
supplying the foreseen documentation (interview), profiling
the investor (profile) and assigning him/her a risk category
(investor classified), classifying the financial products
according to the possible risk levels (classif y). In the profiling
process, the intermediary commits to evaluate, with the help
of a simulation, financial products in order to identify one
that suits the client (C(f p; inv; evaluation)). Such evaluation
(fi evaluation) commits the intermediary to propose a product
with an risk level, that is adequate to the investor’s profile
(C(f p; inv; proposed RiskL)). This commitment is crucial
to satisfy the MiFID’s requirements. A solution that is not
adequate can be discarded (fi discard). In this case the
intermediary’s commitments will be canceled. The withdrawal
phase of MiFID is implemented by the action withdraw,
which concludes a contract by aborting it and by releasing
the commitment from the bank to execute the order. The
selection and evaluation of a new proposal are modeled as
a new interaction.
(f) interview means investor identified, document supplied
if :investor identified ^ :contract abort ^ :contract ended ^
:rejected proposal ^ :fi discarded.
(g) profile means CREATE(C(fp, inv, evaluation)), investor classified
if :investor classified ^ investor identified ^ :contract ended ^
:contract abort ^ :rejected proposal ^ :fi discarded.
(h) classify means classified
if :classified ^ :contract abort ^ :contract ended ^</p>
      <p>:rejected proposal ^ :fi discarded ^ :proposed RiskL.
(i) fi evaluation means CREATE(C(fp, inv, proposed RiskL)), evaluation
if classified ^ investor identified ^ :evaluation ^ :contract abort ^
:contract ended ^ :rejected proposal ^ :fi discarded.
(j) fi discard means fi discarded, CANCEL(C(fp, inv, invested)),</p>
      <p>CANCEL(C(fp, inv, proposed RiskL))
if evaluation ^ :proposed RiskL ^ :contract abort ^</p>
      <p>:contract ended ^ :fi discarded.
(k) order verification means order verified,</p>
      <p>CREATE(C(bank, inv, executed order))
if :order verified ^ order signed.
(l) withdraw means contract abort,</p>
      <p>RELEASE(C(bank, inv, executed order)),</p>
      <p>CANCEL(C(inv, bank, contract ended))
if contract sent ^ :contract ended ^ :contract abort.</p>
      <p>Adding only the specific MiFID actions, and the
commitment (produced by fi evaluation) by the intermediary to
propose a product with a risk level that corresponds to that
of the investor are not enough to implement the directive.
Actions (f–j) should be executed before the actual sale occurs,
while (k) and (l) complete the sales process (see Section II).
This could be done by modifying the action that implement a
sale but this is not in the powers of the MiFID regulation, as
we have explained. This directive, in fact, is to be composed
with the definition of sale. In this setting, in order to analyze
the violations that could take place in real intermediation
contexts, the business protocol must show the same degree
of flexibility that intermediaries and banks have when dealing
with their clients. The integration of the new directive with the
previous regulation is, therefore, done by means of a set of
2CL constraints, which relate facts and commitments which
can appear in the social state and, in particular, those pertaining
MiFID and those pertaining sales. Hereafter are reported the
2CL constraints that capture the most relevant dictates of the
MiFID regulation:
(c1) C(f p; inv; invested) . investor identif ied^</p>
      <p>document supplied
(c2) investor classif ied . C(f p; inv; propose riskL)
(c3) evaluation ^ :f i discarded . proposed RiskL
(c4) order verif ied . contract sent</p>
      <p>(c1) states that once the intermediary took the commitment
to serve the investor, he/she must have the investor identified
and must supply the necessary documentation to him/her. (c2)
expresses the fact that before committing to propose a solution
with a certain degree of risk, the investor must have been
classified. (c3) states that before proposing a financial product
it is necessary to have it positively evaluated by the simulation.</p>
      <p>Finally, before the contract is sent to the client the data of the
order must have been verified by the bank. Figure 2 gives an
idea of the embedding of MiFID inside the sales protocol: the
pink part corresponds to the old sales protocol, the green and
gray parts altogether correspond to the legal execution of the
enriched protocol.</p>
      <p>Analysis of the MiFID business protocol. The MiFID
business protocol produces the graph in Figure 2. Each state in
the graph represents a possible configuration of the social state.
Arrows correspond to actions and are directed. The source is
a state where the “if” condition of the action labeling the arc
holds. The target is, instead, the state obtained by applying the
meaning of the executed action to the source state. States that
are drawn as diamonds with an incoming red arrow represent
the fact that a before constraint has been violated. Some states
are yellow, the meaning (independently from the shape) is
that some response constraints are not fulfilled yet. White
states (independently from the shape) mean that there are some
active commitments (not discharged, released or canceled).
Final acceptable states are white and are denoted by double
circles.</p>
      <p>Figure 2 shows most of the possible executions of the
MiFID business protocol. Among them, it is, first of all,
worthwhile to notice the part highlighted in pink. This part
corresponds to the pre-MiFID interaction but the colors show
that in presence of the new directive, this kind of interaction
is totally illegal. The other parts that are worthwhile to notice
are the ones respectively highlighted in gray and in green. The
green part corresponds again to the pre-MiFID interaction but
now immersed in the additional activities foreseen by MiFID.
The gray part at the beginning amounts to the identification,
qualification, profiling and evaluation phases. The little gray
parts in the bottom correspond to the new MiFID activities of
verification (by the bank) and withdrawal, that the client can
execute. These two activities naturally find their correct place
inside the sales interaction. The colors also help to highlight
the modular composition of the regulations. All other paths
amount to possible violations, as expected since we aggregated
actions that have no mutual preconditions. The designer, by
analyzing the graph, can identify the points where it could
be helpful to intervene to reduce the possible violations, for
instance, by applying enforcement policies or by regimenting
some steps. For example, in Figure 2, one action on which it
would make sense to intervene is propose solution by adding
the condition :fi discarded ^ evaluation, obtaining the graph
in Figure 3. Of course, this choice depends on many factors
(e.g. the cost of the implementation of the prospected solution,
or the time needed to update the financial services office’s
software) that are out of the scope of the directive.</p>
    </sec>
    <sec id="sec-7">
      <title>V. CONCLUSION AND RELATED WORKS</title>
      <p>
        We have proposed a declarative approach to business
protocol specification that extends [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] by explicitly including
2CL temporal regulations. We implemented a tuProlog
extended commitment machine which was applied to the MiFID
case study, whose output allows the analysis of the business
protocol and of possible violations. The protocols that we
tackle are typical of contexts, like MAS, where norms are
seen as soft constraints, i.e. as standards that can be violated
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] – as the Dalai Lama sentence in the title suggests.
Indeed, in these contexts it is important to define mechanisms
for detecting possible violations and decide about possible
regimentations/enforcements. One of the main advantages of
the declarative approach, that we have proposed for the
representation of business protocol, is that it supports a modular
composition of such protocols, as hoped for in [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. This
achievement is obtained thanks to an explicit separation of
the constitutive and of the regulative aspects, the regulative
ones (represented by dashed arrows in Figure 4) playing as
“zippers” that tie stratified specifications.
      </p>
      <p>
        Telang and Singh [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] proposed the first commitment-based
approach to representing business models and identified a
set of common patterns of interaction, that can be used by
the business analyst. Our proposal extends the one in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
by enriching the representation of the constitutive rules with
the representation of expressive regulative rules. The achieved
modularity is an added value in the modeling of business
interactions governed by regulations that stratify along time.
This is, indeed, often the case in the real world, as the
MiFID case study witnesses. Moreover, we supply an analysis
tool that supports the business analyst in performing task
like: understanding the impact of new regulations on the
business model or deciding about enforcement policies or
regimentation.
      </p>
      <p>
        Recently, many works, like [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], focused on the
problem of verifying the compliance of a business process
to a body of norms. This issue is related to the one we have
faced because it concerns business processes that are subject to
regulations. However, it is different in that the business process
is rigidly modeled as a (YAWL or BPM) workflow, and the
verification aims at checking if this process strictly respects
the norms, providing, in some cases, a yes or no answer
and, in some others, a degree of compliance. In contrast, our
commitment-based approach allows a declarative definition of
business models that reduces the gap between the specification
of the regulation itself (normative level, what is allowed or
forbidden) and the one of how achieving the business goals
(business process level). The aim is to support the business
analyst in the analysis of the possible interactions and of the
possible violations, to help him/her in performing strategical
decisions.
      </p>
      <p>
        Another work that it is worthwhile to mention, even though
it does not directly tackle business processes and regulations,
is [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] by Sergot. This work discusses the relationship between
the norms that govern a single agent with those that express a
designer’s view on what overall system behaviors are deemed
to be legal. Also in this case the focus is posed on a
compliance of the resulting interactions with the norms. As
for the previously cited works, this proposal foresees two
models that are to be compared, and to this aim a colored
labeled transition system is used. The main difference w.r.t.
our proposal is that while in Sergot’s approach the focus is
on verifying the behavior of a single agent against a global
model, in our case the focus is on supplying agents a tool for
verifying the behavior of the others w.r.t. a global model, that
is based only on the observational behavior and on a shared
meaning of actions. It would be interesting to study how to
combine the two approaches in order to supply a complete
toolkit to the business analyst.
      </p>
      <p>Acknowledgements: This research has partially been funded
by “Regione Piemonte” through the project ICT4LAW.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P. R.</given-names>
            <surname>Telang</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. P.</given-names>
            <surname>Singh</surname>
          </string-name>
          , “
          <article-title>Abstracting Business Modeling Patterns from RosettaNet,” in Service-Oriented Computing: Agents, Semantics, and</article-title>
          <string-name>
            <surname>Engineering</surname>
          </string-name>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Pesic</surname>
          </string-name>
          and
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          , “
          <article-title>A Declarative Approach for Flexible Business Processes Management,” in Business Process Management Workshops (BPM 2006), ser</article-title>
          . LNCS,
          <string-name>
            <given-names>J.</given-names>
            <surname>Eder</surname>
          </string-name>
          and S. Dustdar, Eds., vol.
          <volume>4103</volume>
          . Springer,
          <year>2006</year>
          , pp.
          <fpage>169</fpage>
          -
          <lpage>180</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Montali</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pesic</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Chesani</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Mello</surname>
            , and
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Storari</surname>
          </string-name>
          , “
          <article-title>Declarative Specification and Verification of Service Choreographiess,” ACM Transactions on the Web (TWEB)</article-title>
          , vol.
          <volume>4</volume>
          , no.
          <issue>1</issue>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M. P.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <source>“An Ontology for Commitments in Multiagent Systems,” Artificial Intelligence and Law</source>
          , vol.
          <volume>7</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>97</fpage>
          -
          <lpage>113</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Baldoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Baroglio</surname>
          </string-name>
          , E. Marengo, and
          <string-name>
            <given-names>V.</given-names>
            <surname>Patti</surname>
          </string-name>
          , “
          <article-title>Constitutive and Regulative Specifications of Commitment Protocols: a Decoupled Approach,” ACM Transactions on Intelligent Systems</article-title>
          and Technology, Special Issue on Agent Communication,
          <year>2011</year>
          , to appear.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>E.</given-names>
            <surname>Marengo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Baldoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Chopra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Baroglio</surname>
          </string-name>
          , V. .
          <string-name>
            <surname>Patti</surname>
            , and
            <given-names>M. P.</given-names>
          </string-name>
          <string-name>
            <surname>Singh</surname>
          </string-name>
          , “
          <article-title>Commitments with Regulations: Reasoning about Safety and Control in REGULA,” in</article-title>
          <source>In Proc. of the 10th International Conference on Autonomous Agents and Multiagent Systems</source>
          ,
          <string-name>
            <surname>AAMAS</surname>
          </string-name>
          <year>2011</year>
          . IFAAMAS,
          <year>2011</year>
          , to appear.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Searle</surname>
          </string-name>
          ,
          <article-title>The construction of social reality</article-title>
          . New York: Free Press,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>C.</given-names>
            <surname>Cherry</surname>
          </string-name>
          , “
          <article-title>Regulative Rules and Constitutive Rules,” The Philosophical Quarterly</article-title>
          , vol.
          <volume>23</volume>
          , no.
          <issue>93</issue>
          , pp.
          <fpage>301</fpage>
          -
          <lpage>315</lpage>
          ,
          <year>1973</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Winikoff</surname>
          </string-name>
          , W. Liu, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Harland</surname>
          </string-name>
          , “Enhancing Commitment Machines,” in
          <source>In Proc. of DALT</source>
          <year>2004</year>
          ,
          <article-title>ser</article-title>
          .
          <source>LNCS</source>
          , vol.
          <volume>3476</volume>
          . Springer,
          <year>2004</year>
          , pp.
          <fpage>198</fpage>
          -
          <lpage>220</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <source>[10] “Directive</source>
          <year>2004</year>
          /
          <article-title>39/EC of the European Parliament and of the Council of 21 April 2004 on markets in financial instruments</article-title>
          ,” pp.
          <fpage>1</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>D. D'Aprile</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Giordano</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Gliozzi</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Martelli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Pozzato</surname>
          </string-name>
          , and D. Theseider Dupre`, “
          <article-title>Verifying business process compliance by reasoning about actions,” in Proc. of the 11th international conference on Computational logic in multi-agent systems, ser</article-title>
          .
          <source>CLIMA'10</source>
          . Berlin, Heidelberg: Springer-Verlag,
          <year>2010</year>
          , pp.
          <fpage>99</fpage>
          -
          <lpage>116</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>G.</given-names>
            <surname>Gibilaro</surname>
          </string-name>
          , “Cassazione Civile Sentenza, Sez. SS.UU.,
          <volume>19</volume>
          /12/2007, n. 26724 e 26725. intermediazione finanziaria,
          <source>nullita` del contratto e risarcimento del danno</source>
          ,”
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A. J. I.</given-names>
            <surname>Jones</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Sergot</surname>
          </string-name>
          ,
          <article-title>On the characterization of law and computer systems: the normative systems perspective</article-title>
          . New York, NY, USA: John Wiley &amp; Sons, Inc.,
          <year>1994</year>
          , pp.
          <fpage>275</fpage>
          -
          <lpage>307</lpage>
          . [Online]. Available: http://portal.acm.org/citation.cfm?id=
          <volume>180954</volume>
          .
          <fpage>180966</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>P.</given-names>
            <surname>Yolum</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. P.</given-names>
            <surname>Singh</surname>
          </string-name>
          , “Commitment Machines,” in Intelligent
          <string-name>
            <surname>Agents</surname>
            <given-names>VIII</given-names>
          </string-name>
          , 8th International Workshop on Agent Theories, Architectures, and
          <article-title>Languages (ATAL), ser</article-title>
          .
          <source>LNCS</source>
          , vol.
          <volume>2333</volume>
          . Springer,
          <year>2001</year>
          , pp.
          <fpage>235</fpage>
          -
          <lpage>247</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Chopra</surname>
          </string-name>
          , “Commitment Alignment: Semantics, Patterns, and
          <article-title>Decision Procedures for Distributed Computing,”</article-title>
          <source>Ph.D. dissertation</source>
          , North Carolina State University, Raleigh,
          <string-name>
            <surname>NC</surname>
          </string-name>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Baldoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Baroglio</surname>
          </string-name>
          , and E. Marengo, “
          <article-title>Behavior-Oriented Commitment-based Protocols,” in Proc. of ECAI, ser</article-title>
          .
          <source>Frontiers in Artificial Intelligence and Applications</source>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Coelho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Studer</surname>
          </string-name>
          , and M. Wooldridge, Eds., vol.
          <volume>215</volume>
          . IOS Press,
          <year>2010</year>
          , pp.
          <fpage>137</fpage>
          -
          <lpage>142</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Baldoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Baroglio</surname>
          </string-name>
          , I. Brunkhorst,
          <string-name>
            <given-names>N.</given-names>
            <surname>Henze</surname>
          </string-name>
          , E. Marengo, and
          <string-name>
            <given-names>V.</given-names>
            <surname>Patti</surname>
          </string-name>
          , “
          <article-title>Constraint Modeling for Curriculum Planning</article-title>
          and Validation,”
          <source>International Journal of Interactive Learning Environments</source>
          , vol.
          <volume>19</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>83</fpage>
          -
          <lpage>123</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Montali</surname>
          </string-name>
          ,
          <article-title>Specification and Verification of Declarative Open Interaction Models: a Logic-Based Approach, ser</article-title>
          .
          <source>LNBIP</source>
          . Springer,
          <year>2010</year>
          , vol.
          <volume>56</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Emerson</surname>
          </string-name>
          , “
          <article-title>Temporal and Modal Logic,” in Handbook of Theoretical Computer Science</article-title>
          , J. van Leeuwen, Ed. North-Holland Pub. Co./MIT Press,
          <year>1990</year>
          , vol.
          <source>B: Formal Models and Sematics</source>
          , pp.
          <fpage>995</fpage>
          -
          <lpage>1072</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>P.</given-names>
            <surname>Yolum</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. P.</given-names>
            <surname>Singh</surname>
          </string-name>
          , “
          <article-title>Designing and Executing Protocols using the Event Calculus</article-title>
          ,”
          <source>in Proceedings of the Fifth International Conference on Autonomous Agents</source>
          ,
          <year>2001</year>
          , pp.
          <fpage>27</fpage>
          -
          <lpage>28</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Chopra</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. P.</given-names>
            <surname>Singh</surname>
          </string-name>
          , “Contextualizing Commitment Protocol,”
          <source>in 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS</source>
          <year>2006</year>
          ). ACM,
          <year>2006</year>
          , pp.
          <fpage>1345</fpage>
          -
          <lpage>1352</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>N.</given-names>
            <surname>Fornara</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Colombetti</surname>
          </string-name>
          , “
          <string-name>
            <given-names>A</given-names>
            <surname>Commitment-Based Approach</surname>
          </string-name>
          To Agent Communication,
          <source>” Applied Artificial Intelligence</source>
          , vol.
          <volume>18</volume>
          , no.
          <issue>9- 10</issue>
          , pp.
          <fpage>853</fpage>
          -
          <lpage>866</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>L.</given-names>
            <surname>Giordano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Martelli</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Schwind</surname>
          </string-name>
          , “
          <article-title>Specifying and Verifying Interaction Protocols in a Temporal Action Logic,”</article-title>
          <source>Journal of Applied Logic</source>
          , vol.
          <volume>5</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>214</fpage>
          -
          <lpage>234</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>M.</given-names>
            <surname>El-Menshawy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bentahar</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Dssouli</surname>
          </string-name>
          , “
          <article-title>Verifiable Semantic Model for Agent Interactions Using Social Commitments,” in LAnguages, methodologies and Development tools for multi-agent systemS (LADS 2009), ser</article-title>
          .
          <source>LNCS</source>
          , vol.
          <volume>6039</volume>
          . Springer,
          <year>2010</year>
          , pp.
          <fpage>128</fpage>
          -
          <lpage>152</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25] --, “
          <article-title>Symbolic Model Checking Commitment Protocols using Reduction,” in Declarative Agent Languages and Technologies VIII, A</article-title>
          . Omicini,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sardina</surname>
          </string-name>
          , and W. Vasconcelos, Eds. Toronto, Canada: Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>G.</given-names>
            <surname>Governatori</surname>
          </string-name>
          , “Law, Logic and Business Processes,”
          <source>in Proc. of Requirements Engineering and Law</source>
          ,
          <string-name>
            <surname>RELAW</surname>
          </string-name>
          <year>2010</year>
          . IEEE,
          <year>2010</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          . [Online]. Available: http://ieeexplore.ieee.org/xpls/absn all.
          <source>jsp? arnumber=5625356</source>
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>T.</given-names>
            <surname>Miller</surname>
          </string-name>
          and
          <string-name>
            <surname>J. McGinnis</surname>
          </string-name>
          , “
          <article-title>Amongst first-class protocols,” in Proc. of Eng. Societies in the Agents World VIII, ser</article-title>
          .
          <source>LNCS</source>
          , vol.
          <volume>4995</volume>
          . Springer,
          <year>2008</year>
          , pp.
          <fpage>208</fpage>
          -
          <lpage>223</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sergot</surname>
          </string-name>
          , “
          <article-title>Action and agency in norm-governed multi-agent systems</article-title>
          ,” in Engineering Societies in the Agents World VIII. Springer,
          <year>2008</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>54</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>