<!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 New Approach of Qualitative Simulation for the Validation of Hybrid Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Slim Medimegh</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jean-Yves Pierron</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jean-Pierre Gallois</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Frédéric Boulanger</string-name>
          <email>frederic.boulanger@lri.fr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CEA</institution>
          ,
          <addr-line>Saclay</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>LRI, CentraleSupélec, Université Paris-Saclay</institution>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Hybrid systems are specified in a heterogeneous form, with discrete and continuous parts. Simulating such systems requires precise data and computational power in order to synchronize continuous changes and discrete transitions. However, in the early design stages, the lack of precision about some parameters forbids such simulations. Qualitative simulation consists in computing only some qualities of the behavior, without computing the exact values. We present here a new approach for the qualitative simulation of hybrid systems, which relies on an abstract model of the state variables and of the qualitative aspects of their evolution. This model is analyzed by the Diversity symbolic execution engine to build the qualitative behaviors of the system.</p>
      </abstract>
      <kwd-group>
        <kwd>hybrid systems</kwd>
        <kwd>qualitative simulation</kwd>
        <kwd>verification</kwd>
        <kwd>validation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Embedded software has become essential in most industrial sectors: energy,
transport, telecommunications, healthcare, home automation. To ensure a high
level of reliability, it is essential to carry out, in the early phases of the
development cycle, an analysis of the behavior of the system when it interacts
with its environment. This environment usually involves various business
knowledge (mechanical, hydraulics, electronics) and it is important to describe each
of them in an appropriate formalism. The whole system (the software and its
environment) is specified in a heterogeneous manner and contains discrete and
continuous parts. The simulation of such hybrid systems requires precise data
and computational power in order to detect changes in the continuous values and
to synchronize them with discrete transitions. However, during the early stages
of the design, the exact value of some parameters is not known yet, while it is
already necessary to check the possible behaviors of the system to make some
design decisions.</p>
      <p>Qualitative simulation can help here because it does not care about exact
values or behaviors. Based on a qualitative model of the system, it computes its
possible qualitative behaviors, which may be enough to make decisions from an
incomplete knowledge of all parameter values.</p>
      <p>In this article, we present a new approach of qualitative simulation, which
relies on a qualitative model of the differential equations of the continuous part of
the system. The analysis of such models identifies possible qualitative scenarios,
some of which may be critical (deadlocks, unreachable states, unstable states).
These scenarios can also be used to generate inputs for precise simulation and
testing of the real system.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Hybrid Systems</title>
      <p>Hybrid systems are dynamic systems that explicitly and simultaneously combine
continuous and discrete behaviors. The modeling of hybrid dynamical systems
can be made using various formalisms, among which hybrid automata, which are
defined by a set of continuous variables and states, and discrete transitions that
include guards and assignments to these variables. The evolution of the
continuous variables can be described by differential equations according to various
possible formalisms.</p>
      <p>
        Polyhedral hybrid automata have linear differential equations and guards.
Rectangular hybrid automata have constant differential equations and guards
that are comparisons to constants. Timed hybrid automata have differential
equations and guards involving time [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], and can be handled by Uppaal [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ],
Kronos [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and recently TiAMo [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Some tools and methods deal with other
types of hybrid systems: Hytech [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] for rectangular hybrid automata with linear
guards on the transitions, CheckMate for non linear continuous evolutions with
linear guards [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and QEPCAD, which deals with polynomial constraints [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Qualitative Simulation</title>
      <p>Qualitative simulation is a
re</p>
      <p>Max search field related to artificial
inIncrease telligence, to automate the
reasoning on continuous aspects of
Start increase Constant Start decrease systems. It considers only
qualitative values, ignoring the
quantiDecrease tative aspect. The purpose of the</p>
      <p>qualitative simulation is to develop
Min a representation that makes it
possible to reason about the
behavFig. 1. Qualitative model of the evolution ior of the physical system
withlaws of continuous variables out the quantitative information.
Figure 1 shows the kind of qualitative changes that we are interested in.</p>
      <p>For hybrid systems, the discrete part of the system is not influenced by the
qualitative abstraction process. However, continuous variables are discretized in
order to consider only their qualitative changes. Therefore, continuous transitions
become discrete transitions, and the resulting system is entirely discrete and can
be treated by traditional methods (property verification, test generation) for the
verification of discrete systems.</p>
    </sec>
    <sec id="sec-4">
      <title>Related Work</title>
      <p>
        Many methods have been developed for qualitative reasoning, for instance:
– The component approach in EnVision by Kleer and Brown, builds a
qualitative model of the system from its components. It takes into consideration
the qualitative sign of the variables. It determines the qualitative states and
the transitions between these states [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
– The Qualitative Process Theory developed by K. D. Forbus models objects
and processes which cause changes to the objects. Qualities of objects are
defined by inequalities about quantities associated to these objects, and the
qualitative behavior of a system is obtained by reasoning on the processes [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
– Qualitative Simulation, in which the qualitative model of the system is a
differential qualitative equation which is an abstraction of an equivalence class
of ordinary differential equations. It relies on the continuity properties of the
variables to build a sequence of qualitative states describing the behavior of
the system [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Many tools have been developed for qualitative analysis:
KAM [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] which deals with nonlinear system with two freedom degrees,
Maps [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] which deals with second and third order systems, PSX2NL [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]
which deals with ordinary differential equations, POINCARE [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] which also
deals with ordinary differential equations with one parameter.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Qualitative Simulation with Diversity</title>
      <p>
        We have implemented our approach in Diversity, a symbolic execution engine
developed at CEA LIST in order to prove safety properties and to automatically
generate tests from state machines models of complex systems [
        <xref ref-type="bibr" rid="ref13 ref7">7,13</xref>
        ].
      </p>
      <p>
        To analyze complex systems that include continuous parts in hybrid
automata, CEA LIST had to extend DIVERSITY with qualitative methods [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
For this, the state machine of hybrid models has continuous variables, which
must be abstracted by a discretization method.
      </p>
      <sec id="sec-5-1">
        <title>Discretization process</title>
        <p>Each continuous variable is represented by a state machine which encodes its
qualitative state: increasing, decreasing, constant etc. The guard of the
transitions depend on the sign of the derivative of the variable, which is constrained
by the differential equations. These equations are analyzed to determine under
which conditions some qualitative changes are possible or not. When the change
is not possible, the corresponding execution branch is cut. When the change is
possible, the branch is tagged with the condition of the change.</p>
        <p>When the structure of the equations is not suitable for processing by a solver,
or to avoid the cost of solving the differential equations, it is possible to perform
qualitative simulation without differential equations, by using only a qualitative
model of these equations. The results are of course less precise, but this approach
can be used at very early stages of the design.</p>
        <p>From this state machines, DIVERSITY generates a tree of behaviors, which
can be analyzed for reachability properties or cycles. Execution traces can be
compared with the result of quantitative simulations, and the compliance of the
numerical simulation to the qualitative simulation can be established.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>A New Approach for Qualitative Simulation</title>
      <p>In order to improve the qualitative simulation without differential equations in
DIVERSITY, we developed a model of execution which constraints the
qualitative evolution of the state variables, and computes their qualitative behavior.
6.1</p>
      <sec id="sec-6-1">
        <title>Model of Execution</title>
        <p>In the model of execution of these values, we consider only continuous changes,
excepted for the second derivative, which is the result of input forces (but this
choice is not definitive). For instance, the value of a state variable cannot change
from Negative to Positive without being Null in between. Moreover, the value
cannot change from Negative to Null unless the first derivative is Positive, and
the same is true for the first derivative with regard to the second derivative.
der = 0 These constraints of continuity and
derivability form a model of execution which
reflects the physical nature of the phenomenon
der &lt;0 = 0 der &gt;0 ttshhtaeattecowmnetarcaohrleinoefmstohadesevliilanlulgus.etrIoatfteiasdsmotnaotdfieeglvueadrreiau2bsilfneo.gr
d A similar automaton controls the changes
&lt; 0 der &gt;0 er &lt;0 &gt; 0 soefcothned fidresrtivadteirviev.aTtivheesweistthateremspaecchtinteos tahree
nondeterministic. For instance, in the &lt; 0
state, if the first derivative is Positive, we
can either stay in the current state, or go to</p>
        <p>Fig. 2. Qualitative changes the = 0 state.
6.2</p>
      </sec>
      <sec id="sec-6-2">
        <title>Computing Qualitative Behaviors</title>
        <p>In order to compute the qualitative behavior of a state variable, we observe the
changes of the values attached to this variable. For instance, when the second
derivative is Negative and the first derivative is Null, we have a Maximum.
However, the current value of a state variable and the current value of its first and
second derivatives are not enough to make a difference between a maximum
and a start of decrease after a constant stage. We therefore model each
continuous state variable in the system by five values: the current (x) and previous
(x 1) values of the variable, the current (x_ ) and previous (x_ 1) values of its first
derivative, and its second derivative (x).</p>
        <p>With this qualitative model of a state variable, we identified 13 qualitative
states:
Constant when x_ 1, x_ and x are null,
FlexStartIncrease when x_ 1 = 0, x_ = 0 and x &gt; 0. The first derivative is not
positive yet, but the dynamics is transitioning toward an increase.
FlexStartDecrease when x_ 1 = 0, x_ = 0 and x &lt; 0. Similar to the previous
case when transitioning toward a decrease.</p>
        <p>StartIncrease when x_ 1 = 0 and x_ &gt; 0. The first derivative has just become
positive. Notice that there is no condition on the second derivative, which
may have come back to 0.</p>
        <p>StartDecrease when x_ 1 = 0 and x_ &lt; 0.</p>
        <p>Increase when x_ 1 &gt; 0 and x_ &gt; 0. The first derivative is positive.
Decrease when x_ 1 &lt; 0 and x_ &lt; 0. The first derivative is negative.
Maximum when x_ 1 &gt; 0, x_ = 0 and x &lt; 0. The three conditions are necessary
to distinguish this case from other qualitative states such as inflection points.
Minimum when x_ 1 &lt; 0, x_ = 0 and x &gt; 0. The three conditions are
necessary to differentiate this case from other qualitative states such as inflection
points.</p>
        <p>FlexIncrease when x_ 1 &gt; 0, x_ = 0 and x &gt; 0. Inflection point during an
increase.</p>
        <p>FlexDecrease when x_ 1 &lt; 0, x_ = 0 and x &lt; 0. Inflection point during a
decrease.</p>
        <p>StopIncrease when x_ 1 &gt; 0, x_ = 0 and x = 0. The state variable reaches a
plateau at the end of an increase.</p>
        <p>StopDecrease when x_ 1 &lt; 0, x_ = 0 and x = 0. The state variable reaches a
plateau at the end of a decrease.</p>
        <p>By additionally taking into account x 1 and x, it is possible to distinguish
sub-cases in these qualitative states, for instance “reaching a null maximum”
when reaching a maximum with x 1 &lt; 0 and x = 0.</p>
        <p>There are impossible cases. Two are due to the continuity of the variable: the
conjunction of x 1 &lt; 0 and x &gt; 0, and the conjunction of x 1 &gt; 0 and x &lt; 0
are impossible. Two others are due to the continuity of the first derivative (no
angular points). Ten others are due to the fact that each variable change should
be consistent with the previous value of the first derivative. For instance, with
x 1 = 0 and x_ 1 = 0, we necessarily have x = 0, because starting from 0 with
a null first derivative, the variable cannot change. Other cases are similar.
6.3</p>
      </sec>
      <sec id="sec-6-3">
        <title>Use Case</title>
        <p>This technique was applied to the simple example of a bouncing ball. In this
example, we have only one state variable, the height of the ball above the ground,
noted z. The usual way to model the bouncing ball is to consider that it has
only one state, in which it is in free fall, with z = g and g = 9:81m:s 2. The
bounce is modeled with a single transition, which is triggered when the ball hits
the ground (z = 0), and reverses the speed of the ball with a damping factor
0 &lt; c 1. This model and its qualitative abstraction are shown on figure 3.</p>
        <p>
          The quantitative behavior of this model, as obtained in the Ptolemy II
environment [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], is illustrated on figure 4.
        </p>
        <p>z &gt; 0
z_ = 0
z = 0 / z_ =</p>
        <p>c:z_
z =
g
z &gt; 0
z_ = 0
z = 0 / z_ =</p>
        <p>z_
z &lt; 0</p>
        <p>This kind of model is an abstraction of what really happens, because if the
ball were really changing its speed instantaneously, there would be an exchange
of a finite amount of energy in zero time between it and its environment, which
corresponds to an infinite power.
6.4</p>
      </sec>
      <sec id="sec-6-4">
        <title>Qualitative Simulation of the Raw Hybrid Model</title>
        <p>When performing the qualitative simulation of this unphysical model using our
model of execution, Diversity finds a dead-lock:</p>
        <p>This dead-lock happens because the model of the ball makes the first
derivative change from negative to positive without going through zero, sticking the
state machine which models the first derivative in its “negative” state.</p>
        <p>Our model of execution enforces the continuity and derivability of physical
states, but the model of the ball violates these properties. However, we have
to handle such models because that is the way engineers model systems, and
quantitative simulation tools are able to handle them as shown on figure 4.
A first solution is to adjust our execution model in order to allow such
“unphysical” transitions. With this model of execution, the qualitative state changes
to “StartIncrease” after the bounce, then to “Increase”, then “Maximum” before
cycling through the “Decrease” state, as shown on figure 6. Therefore, the ball
was able to bounce, and the maximum of its height was detected, but not the
minimum that was reached during the bounce.</p>
        <p>The issue here is that the detection of the qualitative states relies on the
continuity and derivability of the state variable. The discontinuous change of
the velocity of the ball prevents the detection of the minimum.
the Amnoodthelerofsotlhuetiobnalils. tHoowadejvuesrt, zz_ =&gt; 00 z = 0
hwaensdaliedmtohdaetlswaes menugsitnebeersacbrleeattoe z &lt; 0 z &gt; 0
them. In the case of the
bouncing ball, the model can be au- z_ &gt; 0 z_ = 0
tomatically adjusted by replacing z &gt; 0
the bouncing transition by a
series of transitions. The algorithm
for this is as follows: Fig. 7. Adjusted Model for the Bouncing Ball
– changing the derivative from &lt; 0 to &gt; 0 is illegal. The only legal path is
to go from &lt; 0 to = 0 and then from = 0 to &gt; 0, so we replace the illegal
transition by the sequence of these two transitions.
– changing the derivative from &lt; 0 to 0 and from 0 to &gt; 0 requires that
the second derivative be positive, so we make the second derivative positive
during the bounce.</p>
        <p>The resulting state machine is shown on figure 7, where the additional states
have a gray background. The first additional state, reached when z = 0, sets
the second derivative to “Positive” because this is required to make the first
derivative change from “Negative” to “Null”. When the first derivative becomes
null, the second additional state is reached, and when it becomes positive, as
requested by the initial un-physical transition, we can go back to the free fall
state of the ball, with a reversed velocity.</p>
        <p>With this adjusted model of the bouncing ball and the physical model of
qualitative simulation, we obtain the qualitative behavior shown on figure 8.</p>
        <p>The qualitative simulation now correctly detects a minimum when the ball
hits the ground and bounces, and a maximum when the ball reaches its
highest position after having bounced. However, the original model was adjusted to
match the model of computation of the qualitative behavior. How is the
qualitative behavior we obtained related to the behavior of the original model?
6.7</p>
      </sec>
      <sec id="sec-6-5">
        <title>Analysis of the Qualitative Behavior of the Adjusted Model</title>
        <p>In this qualitative simulation, we observe an unexpected artifact: the height
of the ball above the ground becomes negative during the bounce. This comes
from the fact that in the adjusted model, the first derivative takes some time
to become null when the ball hits the ground, so the height goes from null to
negative. Since we adjusted the model to make it more physical, we have to
check if this artifact has some physical meaning.</p>
        <p>The condition z = 0 for triggering the bounce corresponds to the surface
of the ball hitting the ground. Therefore, the z state variable represents the
height of the center of the ball above the ground. z becomes null at the moment
when the ground starts pushing the ball upwards. Therefore, the z &gt; 0 action
we added to adjust the model represents the result of this pushing. This makes
the ball slow down and stop (z_ goes from negative to null), but since z_ is still
negative, z is still decreasing, so it goes from null to negative. For the physical
system, this corresponds to the deformation of the ball, which converts kinetic
energy into elastic tension in the ball (and heat if the collision is not elastic).
When the ball is deformed against the ground, its center is below the position
where it stood when the ball hit the ground, so z is negative.</p>
        <p>We consider that the states and transitions added to adjust the model of
the ball to the model of computation of the qualitative behavior are only
reconstructing the physical behavior of the system that was abstracted in the original
model. In the example of the bouncing ball, this reconstruction was possible in a
single and systematic manner. However, this preliminary work did not allow us
to verify that such adjustments are unique, or that there exists a minimal one
for more complex systems.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Discussion about the Qualitative Model of Execution</title>
      <p>When illustrating our approach on the case study of the bouncing ball, we have
only shown one of the qualitative behavior found by the Diversity tool. Among
the other behaviors, some are physically possible. For instance, after bouncing on
the ground, the ball can go up indefinitely, without reaching a maximum. This
is possible if the ball reaches the escape velocity, but since we ignore the exact
value of the velocity of the ball, we cannot tell, using qualitative simulation,
whether the ball will reach a maximum or fly upwards forever.</p>
      <p>Another possible behavior is more troubling: the ball can fall forever towards
the ground without reaching it. This is indeed possible in our qualitative model
of computation because it is only first order. We qualify only the variations of
the state variable, not the variations of its derivative. Therefore, when the ball
is falling, we only know that its height is decreasing, not that its velocity is
increasing in magnitude. Without this information, it is possible that the ball
goes slower and slower towards the ground, never reaching it, and the good
thing is that the tool finds this behavior. We therefore plan to build a more
complex, second order model of computation which will eliminate such physically
impossible behaviors from the qualitative simulation.
8</p>
    </sec>
    <sec id="sec-8">
      <title>Conclusion and future work</title>
      <p>In this work, we have established a qualitative model of computation based on
the first and the second derivative of the state variables to describe the behavior
of hybrid systems without differential equations (with only a qualitative model
of the equations). Our approach has been applied to the typical hybrid system
example of the bouncing ball. We have shown that we can find a qualitative
path that allows us to describe the whole behavior of the ball, respecting the
continuity and derivability of the first and the second derivative.</p>
      <p>To continue this work, we plan to enrich the model of computation with
second order qualities (qualitative variations of the first derivative) in order to
automatically eliminate some unphysical behaviors from the simulation results.
Another track to explore is dealing with several bounded state variables, with
constraints on their qualitative values or the qualitative value of their derivatives.</p>
      <p>The main goal of this approach is to allow the qualitative analysis of hybrid
models during the early stages of the design of a system. The abstraction process
used to transform an hybrid automata into a qualitative discrete model, and the
automatic transformation of this model into one which does obey the constraints
of “physicality” encoded in our model of execution, are still very experimental.
They can be considered as a kind of abstraction glue to combine the continuous
and the discrete models, and its semantics needs a more precise definition to
improve the confidence in the results of the qualitative simulation.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bengtsson</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Griffioen</surname>
            ,
            <given-names>W.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kristoffersen</surname>
            ,
            <given-names>K.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Larsen</surname>
            ,
            <given-names>K.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Larsson</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pettersson</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yi</surname>
          </string-name>
          , W.:
          <article-title>Automated verification of an audio-control protocol using uppaal</article-title>
          .
          <source>The Journal of Logic and Algebraic Programming</source>
          <volume>52</volume>
          ,
          <fpage>163</fpage>
          -
          <lpage>181</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bouyer</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Colange</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Markey</surname>
          </string-name>
          , N.:
          <article-title>Symbolic optimal reachability in weighted timed automata</article-title>
          . In: Chaudhuri,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Farzan</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.) Computer Aided Verification: 28th International Conference,
          <string-name>
            <surname>CAV</surname>
          </string-name>
          <year>2016</year>
          , Toronto, ON, Canada,
          <source>July 17-23</source>
          ,
          <year>2016</year>
          , Proceedings, Part I. pp.
          <fpage>513</fpage>
          -
          <lpage>530</lpage>
          . Springer International Publishing (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bozga</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daws</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maler</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olivero</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tripakis</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yovine</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : Kronos:
          <article-title>A model-checking tool for real-time systems</article-title>
          . In: Ravn,
          <string-name>
            <given-names>A.P.</given-names>
            ,
            <surname>Rischel</surname>
          </string-name>
          , H. (eds.)
          <article-title>Formal Techniques in Real-Time and Fault-Tolerant Systems: 5th International Symposium</article-title>
          , FTRTFT'98 Lyngby, Denmark,
          <source>September 14-18</source>
          ,
          <year>1998</year>
          Proceedings. pp.
          <fpage>298</fpage>
          -
          <lpage>302</lpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Chutinan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krogh</surname>
            ,
            <given-names>B.H.</given-names>
          </string-name>
          :
          <article-title>Computational techniques for hybrid system verification</article-title>
          .
          <source>IEEE Trans. Automat. Contr</source>
          .
          <volume>48</volume>
          ,
          <fpage>64</fpage>
          -
          <lpage>75</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Eker</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Janneck</surname>
            ,
            <given-names>J.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>E.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ludvig</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sachs</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiong</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neuendorffer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Taming heterogeneity - the ptolemy approach</article-title>
          .
          <source>Proceedings of the IEEE</source>
          <volume>91</volume>
          (
          <issue>1</issue>
          ),
          <fpage>127</fpage>
          -
          <lpage>144</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Forbus</surname>
          </string-name>
          , K.D.:
          <article-title>Qualitative process theory</article-title>
          .
          <source>Artif. Intell</source>
          .
          <volume>24</volume>
          (
          <issue>1-3</issue>
          ),
          <fpage>85</fpage>
          -
          <lpage>168</lpage>
          (
          <year>Dec 1984</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Gallois</surname>
            ,
            <given-names>J.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lanusse</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Le test structurel pour la vérification de spécifications de systèmes industriels: L'outil agatha</article-title>
          .
          <source>In: Fiabilité &amp; maintenabilité. Colloque national</source>
          . pp.
          <fpage>566</fpage>
          -
          <lpage>574</lpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Gallois</surname>
            ,
            <given-names>J.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pierron</surname>
            ,
            <given-names>J.Y.</given-names>
          </string-name>
          :
          <article-title>Qualitative simulation and validation of complex hybrid systems</article-title>
          .
          <source>In: 8th European Congress on Embedded Real Time Software and Systems (ERTS</source>
          <year>2016</year>
          ). TOULOUSE, France (
          <year>Jan 2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Henzinger</surname>
            ,
            <given-names>T.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ho</surname>
            ,
            <given-names>P.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wong-Toi</surname>
          </string-name>
          , H.:
          <article-title>Hytech: A model checker for hybrid systems</article-title>
          . In: Grumberg,
          <string-name>
            <surname>O</surname>
          </string-name>
          . (ed.) Computer Aided Verification: 9th International Conference, CAV'97 Haifa, Israel, June 22-25,
          <year>1997</year>
          Proceedings. pp.
          <fpage>460</fpage>
          -
          <lpage>463</lpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kleer</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brown</surname>
            ,
            <given-names>J.S.:</given-names>
          </string-name>
          <article-title>A qualitative physics based on confluences</article-title>
          .
          <source>Artificial Intelligence</source>
          <volume>24</volume>
          (
          <issue>1</issue>
          ),
          <fpage>7</fpage>
          -
          <lpage>83</lpage>
          (
          <year>1984</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Kuipers</surname>
            ,
            <given-names>B.J.</given-names>
          </string-name>
          :
          <article-title>Qualitative simulation</article-title>
          .
          <source>Artif. Intell</source>
          .
          <volume>29</volume>
          (
          <issue>3</issue>
          ),
          <fpage>289</fpage>
          -
          <lpage>338</lpage>
          (
          <year>Sep 1986</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Nishida</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Artificial intelligence research in japan grammatical description of behaviors of ordinary differential equations in two-dimensional phase space</article-title>
          .
          <source>Artificial Intelligence</source>
          <volume>91</volume>
          (
          <issue>1</issue>
          ),
          <fpage>3</fpage>
          -
          <lpage>32</lpage>
          (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Rapin</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gaston</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lapitre</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gallois</surname>
            ,
            <given-names>J.P.</given-names>
          </string-name>
          :
          <article-title>Behavioural unfolding of formal specifications based on communicating automata</article-title>
          .
          <source>In: Proceedings of first Workshop on Automated technology for verification and analysis (</source>
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Sacks</surname>
            ,
            <given-names>E.P.</given-names>
          </string-name>
          :
          <article-title>Automatic analysis of one-parameter planar ordinary differential equations by intelligent numeric simulation</article-title>
          .
          <source>Artificial Intelligence</source>
          <volume>48</volume>
          (
          <issue>1</issue>
          ),
          <fpage>27</fpage>
          -
          <lpage>56</lpage>
          (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Tiwari</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khanna</surname>
          </string-name>
          , G.:
          <article-title>Series of abstractions for hybrid automata</article-title>
          . In: Tomlin,
          <string-name>
            <given-names>C.J.</given-names>
            ,
            <surname>Greenstreet</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.R</surname>
          </string-name>
          . (eds.)
          <source>Hybrid Systems: Computation and Control: 5th International Workshop</source>
          , HSCC 2002 Stanford, CA, USA, March
          <volume>25</volume>
          -27,
          <year>2002</year>
          Proceedings. pp.
          <fpage>465</fpage>
          -
          <lpage>478</lpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Yip</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.M.K</surname>
          </string-name>
          .:
          <article-title>KAM : a system for intelligently guiding numerical experimentation by computer</article-title>
          .
          <source>Artificial intelligence</source>
          , MIT press, Cambridge, MA, London (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Computational dynamics: Modeling and visualizing trajectory flows in phase space</article-title>
          .
          <source>Annals of Mathematics and Artificial Intelligence</source>
          <volume>8</volume>
          (
          <issue>3</issue>
          ),
          <fpage>285</fpage>
          -
          <lpage>300</lpage>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>