<!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>A Prototype for the Robust Execution of Flexible Plans</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Annarita Lanzilli</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marta Cialdea Mayer</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Amedeo Cesta</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrea Orlandini</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Umbrico</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ISTC-CNR</institution>
          ,
          <addr-line>Rome</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>ROMA TRE University</institution>
          ,
          <addr-line>Rome</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <fpage>19</fpage>
      <lpage>20</lpage>
      <abstract>
        <p>Timeline-based Planning and Scheduling (P&amp;S) usually deals with two main sources of uncertainty: some components may depend on an external environment and cannot be planned; there may be tasks whose duration cannot be exactly foreseen in advance. Such uncertainties are formally defined and consequent controllability issues have been addressed, focusing on dynamic controllability. In this work, we present a new software prototype, tiga2exec, for dynamic controllable execution of timeline-based plans leveraging recent results gathered from the integration of P&amp;S and Model Checking techniques. tiga2exec is deployed in a timeline-based planning system to control plan execution guaranteeing dynamic controllability. A preliminary experimental evaluation is also presented.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        approach presented in [
        <xref ref-type="bibr" rid="ref13 ref4">4, 13</xref>
        ], a verification tool, UPPAAL-TIGA [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], is exploited to verify whether
a flexible plan is dynamically controllable and to generate a dynamic execution strategy by solving a
reachability game. The above notions have also been extended to a timeline-based framework [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], following
an approach similar to what presented here, i.e. based on model checking with TGA to check flexible
plans against dynamic controllability and to generate a robust plan controller able to execute flexible
timeline-based plans [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ]. In this work, we present a software prototype, tiga2exec, for dynamic
controllable execution of timeline-based plans pursuing the same approach presented in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. tiga2exec
implements a work chain that i) encodes flexible plans as a network of TGA, ii) exploits UPPAAL-TIGA
to check dynamic controllability property for flexible plans and generate dynamic execution strategies
and iii) implements such strategies as robust plan execution controllers. tiga2exec is deployed in a
P&amp;S system, i.e., PLATINUm, to control plan execution while guaranteeing dynamic controllability. A
preliminary experimental evaluation is also presented considering a benchmark domain introduced in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Timeline-based Planning and Execution</title>
      <p>
        A timeline-based planning domain contains the characterization of a set of state variables, representing the
components of a system. A state variable x is characterized by the set of values it may assume, denoted
by values(x), possible upper and lower bounds on the duration of each value, and rules governing the
correct sequencing of such values. A timeline for a state variable is made up of a finite sequence of valued
intervals, called tokens, each of which represents a time slot where the variable assumes a given value. In
general, timelines may be flexible, i.e., the start and end times of each of its tokens are not necessarily
fixed time points, but may range in given intervals. Tokens in a timeline for the state variable x are
denoted by expressions of the form xi, where the superscript indicates the position of the token in the
timeline. Each token xi is characterized by a value vi ∈ values(x), an end time interval [ei, e0i] referred to
as end_time(xi), and a duration interval [di, d0i] (as usual, the notation [x, y] denotes the closed interval
{t | x ≤ t ≤ y}). The start time interval start_time(xi) of the token xi is [0, 0] if xi is the first token of
the timeline (i.e. i = 1), otherwhise, if i &gt; 1, start_time(xi) = end_time(xi−1). So, a token has the form
xi = (vi, [ei, e0i], [di, d0i]) and a timeline is a finite sequence of tokens x1, . . . , xk. The metasymbol F T L
(F T Lx) will henceforth be used to denote a timeline (for the state variable x), and FTL to denote a set of
timelines. Being tokens flexible, their exact start end end times will be decided at execution time. Tokens
can be either controllable (the controller can decide both their start and end time), or uncontrollable
(both start and end time depend on the environment’s choices), or partially controllable (the controller
can decide when to start them, but their exact duration is outside the system’s control). Each token is
consequently equipped also with a controllability tag, identifying the class it belongs to. The presented
theoretical background follows the formal framework presented in [
        <xref ref-type="bibr" rid="ref5 ref7">7, 5</xref>
        ].
      </p>
      <p>
        The behavior of state variables may be restricted by requiring that time intervals with given state
variable values satisfy some temporal constraints. Such constraints are stated as a set of synchronization
rules which relate tokens on possibly different timelines through temporal relations between intervals
or between an interval and a time point. These temporal relations refer to token start or end points,
that will henceforth be called events. Other relations between tokens [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] can be defined in terms of the
primitive ones. Temporal relations are also used to state the synchronization rules of the planning domain.
A flexible plan Π is a pair (FTL, R), where FTL is a set of timelines and R is a set of temporal relations,
involving tokens in some timelines in FTL. An instance of the flexible plan Π = (FTL, R), is any schedule
of FTL (i.e., set of timelines with fixed timings) that satisfies every relation in R. In order for a flexible
plan Π = (FTL, R) to satisfy a synchronization rule it must be the case that R contains temporal relations
guaranteeing what the rule requires. During the execution, not any possible instance of a flexible solution
plan can be safely executed, depending on how the environment will decide to schedule external variables
and uncontrollable tokens. Thus, a control strategy is needed to determine how to schedule controllable
tasks. A flexible solution plan is said to be dynamically controllable if there exists a control strategy that
is able to schedule all the controllable time points such that (i) all problem rules are satisfied and (ii) only
past events are considered to decide the schedule of subsequent ones. We focus on dynamic controllability
since it is the property that most often captures the needs of real world scenarios. In [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], a semantics of
flexible plans in terms of TGA networks is also defined, showing how flexible plans can be encoded into
such formalism (see also Plan2Tiga http://cialdea.dia.uniroma3.it/plan2tiga/). This allows to
exploit existing verification tools for TGA to check dynamic controllability property for flexible plans and,
possibly, generate a dynamic execution strategy that can be used for robust plan execution.
      </p>
      <p>
        A new prototype for robust timeline-based plan execution
tiga2exec is a new software prototype composed by a set of modules for representing a strategy generated
by UPPAAL-TIGA and making it accessible (via a suitable software interface) for timeline-based P&amp;S
systems to provide plan dispatching strategy, i.e., a dynamic decision mechanism for token activation
according to a given system status and execution time. Three main features are considered for prototype
design: strategy representation, creation and access. Strategy representation is based on the format of the
output provided by UPPAAL-TIGA. Namely, a winning strategy generated by the TGA model checker
is a set of rules, each of which is composed by a set of state formulae (a pair timeline-token) associated
to actions to be performed. Each state usually has two possible actions: one associated to an actual
transition (an action leading to a value change on a state variable) with some temporal constraints derived
from guards on transitions in the associated TGA network and one special action that requires the system
to wait. If a transition is uncontrollable, only a wait action is represented as the value change is supposed
to be executed by the environment. In order to enable its actions, each strategy is associated to temporal
guards (temporal constraints) and to clock updates (for checking temporal constraints). The software
structure of tiga2exec replicates this hierarchy and has been deployed within PLATINUm [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>
        tiga2exec workflow is the following: once a plan is generated by PLATINUm, tiga2exec triggers
Plan2Tiga, an encoder capable to translate a flexible plan in a TGA network and provided as input for
UPPAAL-TIGA. The model checker verifies the TGA network in order to check dynamic controllability
and, if possible, generates a winning strategy. tiga2exec then analyzes the output to check whether
the plan is DC or not (i.e., plan either dynamically controllable or not controllable). The strategy is
then encoded as a set of software objects triggered by specific conditions (i.e., states and timings) and
issuing the corresponding actions defined in the winning strategy. Indeed, a P&amp;S system can access the
strategy querying step-by-step tiga2exec about which are the actions to be performed. During each
execution step, tiga2exec will perform a cycle to extract actions from the strategy. For each cycle,
tiga2exec performs a synchronization phase and a dispatching phase. The synchronization phase is
for collecting data from the P&amp;S system and the environment (via external observations) and to check
whether the actual plan execution is coherent with the plan specifications. The dispatching phase is about
tokens selection and dispatching. Some variables representing the status of the execution are added to
the strategy representation as well as some internal clocks for supervising the execution. The last status
of the system is considered to track uncontrollable transitions that may occur and, in case, update the
internal system status with post conditions for these transitions. In general, tiga2exec can return a
list of tokens to be dispatched (dispatching actions until a wait action is found). The internal logic to
implement these steps is the following: a) The actual status perceived by the P&amp;S system is compared
with the expected status by tiga2exec; b) internal plan clocks are updated; c) Each internal state is
compared to the actual status and when they match, an action trigger is searched between the rules in
the strategy; d) once a match is found, the action is added to the list of actions to be dispatched and
post conditions are applied to the internal status. If a match is not found, an action wait is added to
the action list and the list is returned. tiga2exec is fully integrated within PLATINUm and can be
integrated in any timeline-based P&amp;S system implemented according to the framework given in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        We present some preliminary empirical results considering a benchmark domain for planning and
scheduling introduced in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] modelling a satellite operating around a remote planet and performing science
and communication activities with uncertain conditions. This experimental analysis is performed to assess
the general performance of tiga2exec. In particular, performance evaluation is crucial as in plan-based
control, the frequency of each cycle entails the executive system to be able to provide a set of actions
to be dispatched within a fixed time. Therefore, the overhead introduced by tiga2exec for analyzing
and processing a high number of tokens and relations may explode and be not fully compatible with such
execution latencies. To this aim, we consider three set of batches of tests run on a machine endowed
with Intel Core i5 (2.4GHz) processor and 8 GB RAM. Each set corresponds to different settings of the
same planning domain. Here, we consider the following specific settings: Domain1 models a set of three
(fully uncontrollable) temporal windows for communications with a given planning horizon; Domain2
extends the previous setting relaxing the temporal constraints on communication windows, i.e., providing
more time for communications and, consequently increasing the opportunities for the planner to allocate
communication tasks; Domain3 further extends the previous settings doubling the size of the temporal
horizon, i.e., providing the planner with more time to schedule tasks over time. Then, for each domain,
we consider a set of problem instances with an increasing number of goals, i.e., an increasing number
of science (and communications) tasks to be performed (spanning from 1 to 5) as well as an increasing
temporal uncertainty of uncontrollable tasks (spanning from 5 to 30 time seconds). We perform 5 runs
of the same problem and consider average times. It is worth noticing that the most complex planning
scenario is the one with higher number of goals (5 goals), and higher temporal uncertainty (30 secs).
      </p>
      <p>Domain1</p>
      <p>Domain2</p>
      <p>Domain3
%DC %WEAK %NO PLAN %TIMEOUT
%DC %WEAK %NO PLAN %TIMEOUT
%DC %WEAK %NO PLAN %TIMEOUT</p>
      <p>Figure 1 depicts for each domain plan generation success rate and, when generated, plan controllability.
In Domain1, experiments show a high rate of planning failures (50%). The planner is guided by heuristics
to minimize plan makespan and, thus, scheduling science and communication tasks as soon as possible.
All science/communications are then scheduled during the first temporal window resulting in a plan with
small flexibility to deal with temporal uncertainty. Increasing the number of goals, many tasks are planned
in a temporally rigid way and often being unable to achieve all the goals (i.e., no valid plan). The planner
is able to generate DC plans for problem instances only with a limited number of goals. In Domain2, the
planner is always able to generate a plan but not fully controllable as almost half of the plans were only
weakly controllable. In order to achieve the goals within the given planning horizon, the planner is forced
to tightly schedule tasks and, again, only when dealing with a small number of goals the planner was able
to keep DC. In the other instances, the planner produces weakly controllable plans. In Domain3, a larger
planning horizon allows the planner to always generate DC plans and to complete plans execution.</p>
      <p>Figure 2 shows the average temporal costs for, respectively, planning, verification (Plan2Tiga +
UPPAAL-TIGA) and strategy management when tiga2exec is involved for the problem instances
considered in Domain3 varying the number of goals and the temporal uncertainty. First, it is clear that
verification and strategy management costs are compatible with planning latencies. Then, an increase of
temporal uncertainty does not affect costs as planning and verification systems are effective in managing
temporal flexibility. For PLATINUm and tiga2exec, the most important element influencing costs is
the number of goals. In fact, increasing the number of goals, generated plans contains more tokens and
control strategies are larger (in terms of control rules). This entails larger times for strategy management.
4</p>
    </sec>
    <sec id="sec-3">
      <title>Conclusions</title>
      <p>This paper presents tiga2exec, a new software prototype, for dynamic controllable execution of
timelinebased plans leveraging the integration of P&amp;S and Model Checking techniques. tiga2exec implements a
work chain that i) encodes flexible plans as a network of TGA, ii) exploits a verification tool to check
dynamic controllability property for flexible plans and, possibly, generate a dynamic execution strategy
and iii) implements such strategy as a robust plan execution controller for P&amp;S systems. tiga2exec
is deployed in PLATINUm, a timeline-based planning system to control plan execution guaranteeing
dynamic controllability. A preliminary experimental evaluation is also presented.</p>
    </sec>
    <sec id="sec-4">
      <title>Acnkowledgments</title>
      <p>CNR authors are partially supported by the E.C. and ShareWork project (H2020 – Factories of the Future
G.A. nr. 820807).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J. F.</given-names>
            <surname>Allen</surname>
          </string-name>
          .
          <article-title>Maintaining knowledge about temporal intervals</article-title>
          .
          <source>Commun. ACM</source>
          ,
          <volume>26</volume>
          (
          <issue>11</issue>
          ):
          <fpage>832</fpage>
          -
          <lpage>843</lpage>
          ,
          <year>1983</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>F.</given-names>
            <surname>Cassez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>David</surname>
          </string-name>
          , E. Fleury,
          <string-name>
            <given-names>K. G.</given-names>
            <surname>Larsen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Lime</surname>
          </string-name>
          .
          <article-title>Efficient on-the-fly algorithms for the analysis of timed games</article-title>
          .
          <source>In CONCUR 2005</source>
          , pages
          <fpage>66</fpage>
          -
          <lpage>80</lpage>
          . Springer-Verlag,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Cesta</surname>
          </string-name>
          , G. Cortellessa,
          <string-name>
            <given-names>S.</given-names>
            <surname>Fratini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Oddi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N.</given-names>
            <surname>Policella</surname>
          </string-name>
          .
          <article-title>An Innovative Product for Space Mission Planning: An A Posteriori Evaluation</article-title>
          .
          <source>In ICAPS</source>
          , pages
          <fpage>57</fpage>
          -
          <lpage>64</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Cesta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Finzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Fratini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Orlandini</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Tronci</surname>
          </string-name>
          .
          <article-title>Analyzing Flexible Timeline Plan</article-title>
          .
          <source>In ECAI 2010. Proc. of the 19th European Conference on Artificial Intelligence</source>
          . IOS Press,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M. Cialdea</given-names>
            <surname>Mayer</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Orlandini</surname>
          </string-name>
          .
          <article-title>An executable semantics of flexible plans in terms of timed game automata</article-title>
          .
          <source>In The 22nd International Symposium on Temporal Representation and Reasoning (TIME)</source>
          . IEEE,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Cialdea Mayer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Orlandini</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Umbrico</surname>
          </string-name>
          .
          <article-title>A formal account of planning with flexible timelines</article-title>
          .
          <source>In The 21st International Symposium on Temporal Representation and Reasoning (TIME)</source>
          , pages
          <fpage>37</fpage>
          -
          <lpage>46</lpage>
          . IEEE,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Cialdea Mayer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Orlandini</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Umbrico</surname>
          </string-name>
          .
          <article-title>Planning and execution with flexible timelines: a formal account</article-title>
          .
          <source>Acta Informatica</source>
          ,
          <volume>53</volume>
          (
          <issue>6-8</issue>
          ):
          <fpage>649</fpage>
          -
          <lpage>680</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jonsson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Morris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Muscettola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Rajan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Smith</surname>
          </string-name>
          .
          <article-title>Planning in Interplanetary Space: Theory and Practice</article-title>
          .
          <source>In AIPS-00. Proc. of the 5th Int. Conf. on AI Planning and Scheduling</source>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Lemai</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Ingrand</surname>
          </string-name>
          .
          <article-title>Interleaving Temporal Planning and Execution in Robotics Domains</article-title>
          .
          <source>In AAAI-04</source>
          , pages
          <fpage>617</fpage>
          -
          <lpage>622</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>O.</given-names>
            <surname>Maler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pnueli</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Sifakis</surname>
          </string-name>
          .
          <article-title>On the Synthesis of Discrete Controllers for Timed Systems</article-title>
          . In STACS, LNCS, pages
          <fpage>229</fpage>
          -
          <lpage>242</lpage>
          . Springer,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>P. H.</given-names>
            <surname>Morris</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Muscettola</surname>
          </string-name>
          .
          <article-title>Temporal Dynamic Controllability Revisited</article-title>
          .
          <source>In Proc. of AAAI</source>
          <year>2005</year>
          , pages
          <fpage>1193</fpage>
          -
          <lpage>1198</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>N.</given-names>
            <surname>Muscettola</surname>
          </string-name>
          . HSTS:
          <article-title>Integrating Planning and Scheduling</article-title>
          . In Zweben, M. and
          <string-name>
            <surname>Fox</surname>
          </string-name>
          , M.S., editor,
          <source>Intelligent Scheduling. Morgan Kauffmann</source>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Orlandini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Finzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cesta</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Fratini</surname>
          </string-name>
          .
          <article-title>Tga-based controllers for flexible plan execution</article-title>
          .
          <source>In KI 2011: Advances in Artificial Intelligence, 34th Annual German Conference on AI.</source>
          , volume
          <volume>7006</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>233</fpage>
          -
          <lpage>245</lpage>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Orlandini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Suriano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cesta</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Finzi</surname>
          </string-name>
          .
          <article-title>Controller synthesis for safety critical planning</article-title>
          .
          <source>In IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI</source>
          <year>2013</year>
          ), pages
          <fpage>306</fpage>
          -
          <lpage>313</lpage>
          . IEEE,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Umbrico</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cesta</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Cialdea Mayer, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Orlandini</surname>
          </string-name>
          .
          <article-title>Platinum: A new framework for planning and acting</article-title>
          . In F. Esposito,
          <string-name>
            <given-names>R.</given-names>
            <surname>Basili</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ferilli</surname>
          </string-name>
          , and
          <string-name>
            <surname>F. A</surname>
          </string-name>
          . Lisi, editors,
          <source>AI*IA 2017 Advances in Artificial Intelligence</source>
          , pages
          <fpage>498</fpage>
          -
          <lpage>512</lpage>
          , Cham,
          <year>2017</year>
          . Springer International Publishing.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>