<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN" "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="application/xhtml+xml; charset=utf-8"/>
    <title>Project-Team:MEXICO</title>
    <link rel="stylesheet" href="../static/css/raweb.css" type="text/css"/>
    <meta name="description" content="Highlights of the Year - Highlights of the Year"/>
    <meta name="dc.title" content="Highlights of the Year - Highlights of the Year"/>
    <meta name="dc.subject" content=""/>
    <meta name="dc.publisher" content="INRIA"/>
    <meta name="dc.date" content="(SCHEME=ISO8601) 2016-01"/>
    <meta name="dc.type" content="Report"/>
    <meta name="dc.language" content="(SCHEME=ISO639-1) en"/>
    <meta name="projet" content="MEXICO"/>
    <script type="text/javascript" src="https://raweb.inria.fr/rapportsactivite/RA2016/static/MathJax/MathJax.js?config=TeX-MML-AM_CHTML">
      <!--MathJax-->
    </script>
  </head>
  <body>
    <div class="tdmdiv">
      <div class="logo">
        <a href="http://www.inria.fr">
          <img style="align:bottom; border:none" src="../static/img/icons/logo_INRIA-coul.jpg" alt="Inria"/>
        </a>
      </div>
      <div class="TdmEntry">
        <div class="tdmentete">
          <a href="uid0.html">Project-Team Mexico</a>
        </div>
        <span>
          <a href="uid1.html">Members</a>
        </span>
      </div>
      <div class="TdmEntry">Overall Objectives<ul><li><a href="./uid3.html">Scientific Objectives</a></li></ul></div>
      <div class="TdmEntry">Research Program<ul><li><a href="uid15.html&#10;&#9;&#9;  ">Concurrency</a></li><li><a href="uid23.html&#10;&#9;&#9;  ">Interaction</a></li><li><a href="uid28.html&#10;&#9;&#9;  ">Management of Quantitative Behavior</a></li></ul></div>
      <div class="TdmEntry">Application Domains<ul><li><a href="uid45.html&#10;&#9;&#9;  ">Telecommunications</a></li><li><a href="uid48.html&#10;&#9;&#9;  ">Transport Systems</a></li><li><a href="uid54.html&#10;&#9;&#9;  ">Biological Systems</a></li></ul></div>
      <div class="tdmActPage">
        <a href="./uid56.html">Highlights of the Year</a>
      </div>
      <div class="TdmEntry">New Software and Platforms<ul><li><a href="uid58.html&#10;&#9;&#9;  ">DarkSider</a></li><li><a href="uid62.html&#10;&#9;&#9;  ">COSMOS</a></li><li><a href="uid66.html&#10;&#9;&#9;  ">CosyVerif</a></li><li><a href="uid71.html&#10;&#9;&#9;  ">Mole</a></li></ul></div>
      <div class="TdmEntry">New Results<ul><li><a href="uid76.html&#10;&#9;&#9;  ">Analyzing Timed Systems Using Tree Automata</a></li><li><a href="uid77.html&#10;&#9;&#9;  ">Interrupt Timed Automata with Auxiliary Clocks and Parameters</a></li><li><a href="uid78.html&#10;&#9;&#9;  ">One-Counter Automata with Counter Observability</a></li><li><a href="uid79.html&#10;&#9;&#9;  ">Diagnosis in Infinite-State Probabilistic Systems</a></li><li><a href="uid80.html&#10;&#9;&#9;  ">Accurate Approximate Diagnosability of Stochastic Systems</a></li><li><a href="uid81.html&#10;&#9;&#9;  ">Diagnosability of Repairable Faults</a></li><li><a href="uid82.html&#10;&#9;&#9;  ">Optimal constructions for active diagnosis</a></li><li><a href="uid83.html&#10;&#9;&#9;  ">Verification of parameterized communicating automata via split-width</a></li><li><a href="uid84.html&#10;&#9;&#9;  ">Cyclic Ordering through Partial Orders</a></li><li><a href="uid85.html&#10;&#9;&#9;  ">Predicting Traffic Load in Public Transportation Networks</a></li><li><a href="uid86.html&#10;&#9;&#9;  ">Unfolding of Parametric Logical Regulatory Networks</a></li><li><a href="uid87.html&#10;&#9;&#9;  ">Relationship between the Reprogramming Determinants of Boolean Networks and their Interaction Graph</a></li><li><a href="uid88.html&#10;&#9;&#9;  ">D-SPACES: An Implementation of Declarative Semantics for Spatially Structured Information</a></li><li><a href="uid89.html&#10;&#9;&#9;  ">Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion</a></li><li><a href="uid90.html&#10;&#9;&#9;  ">Goal-Driven Unfolding of Petri Nets</a></li></ul></div>
      <div class="TdmEntry">Partnerships and Cooperations<ul><li><a href="uid92.html&#10;&#9;&#9;  ">National Initiatives</a></li><li><a href="uid93.html&#10;&#9;&#9;  ">European Initiatives</a></li><li><a href="uid95.html&#10;&#9;&#9;  ">International Initiatives</a></li><li><a href="uid105.html&#10;&#9;&#9;  ">International Research Visitors</a></li></ul></div>
      <div class="TdmEntry">Dissemination<ul><li><a href="uid115.html&#10;&#9;&#9;  ">Promoting Scientific Activities</a></li><li><a href="uid146.html&#10;&#9;&#9;  ">Teaching - Supervision - Juries</a></li><li><a href="uid171.html&#10;&#9;&#9;  ">Popularization</a></li></ul></div>
      <div class="TdmEntry">
        <div>Bibliography</div>
      </div>
      <div class="TdmEntry">
        <ul>
          <li>
            <a id="tdmbibentmajor" href="bibliography.html">Major publications</a>
          </li>
          <li>
            <a id="tdmbibentyear" href="bibliography.html#year">Publications of the year</a>
          </li>
          <li>
            <a id="tdmbibentfoot" href="bibliography.html#References">References in notes</a>
          </li>
        </ul>
      </div>
    </div>
    <div id="main">
      <div class="mainentete">
        <div id="head_agauche">
          <small><a href="http://www.inria.fr">
	    
	    Inria
	  </a> | <a href="../index.html">
	    
	    Raweb 
	    2016</a> | <a href="http://www.inria.fr/en/teams/mexico">Presentation of the Project-Team MEXICO</a> | <a href="http://www.lsv.ens-cachan.fr/axes/MEXICO/mexico?l=en">MEXICO Web Site
	  </a></small>
        </div>
        <div id="head_adroite">
          <table class="qrcode">
            <tr>
              <td>
                <a href="mexico.xml">
                  <img style="align:bottom; border:none" alt="XML" src="../static/img/icons/xml_motif.png"/>
                </a>
              </td>
              <td>
                <a href="mexico.pdf">
                  <img style="align:bottom; border:none" alt="PDF" src="IMG/qrcode-mexico-pdf.png"/>
                </a>
              </td>
              <td>
                <a href="../mexico/mexico.epub">
                  <img style="align:bottom; border:none" alt="e-pub" src="IMG/qrcode-mexico-epub.png"/>
                </a>
              </td>
            </tr>
            <tr>
              <td/>
              <td>PDF
</td>
              <td>e-Pub
</td>
            </tr>
          </table>
        </div>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid54.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid58.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
      <div id="textepage">
        <!--DEBUT2 du corps du module-->
        <h2>Section: 
      Highlights of the Year</h2>
        <h3 class="titre3">Highlights of the Year</h3>
        <p>
          <big>
            <b>Diagnosis, Anti-alignments and Coverability</b>
          </big>
        </p>
        <p>
          <span class="smallcap">Diagnosis </span>
        </p>
        <p>Several new advances were obtained, concerning Diagnosis in Infinite-State Probabilistic Systems,
Approximate Diagnosability of Stochastic Systems, and
Diagnosability of Repairable Faults; see the 'New Results' section for a detailed description.</p>
        <p>
          <span class="smallcap">Anti-Alignments in Conformance Checking – The Dark Side of Process Models </span>
        </p>
        <p>Conformance checking techniques asses the suitability of a process model in representing an underlying process, observed through a collection of real executions. These techniques suffer from the well-known state space explosion problem, hence handling process models exhibiting large or even infinite state spaces remains a challenge. One important metric in conformance checking is to asses the precision of the model with respect to the observed executions, i.e., characterize the ability of the model to produce behavior unrelated to the one observed. By avoiding the computation of the full state space of a model, current techniques only provide estimations of the precision metric, which in some situations tend to be very optimistic, thus hiding real problems a process model may have. In <a href="./bibliography.html#mexico-2016-bid38">[15]</a>, <a href="./bibliography.html#mexico-2016-bid39">[25]</a> we present the notion of anti-alignment as a concept to help unveiling traces in the model that may deviate significantly from the observed behavior. Using anti-alignments, current estimations can be improved, e.g., in precision checking. We show how to express the problem of finding anti-alignments as the satisfiability of a Boolean formula, and provide a tool which can deal with large models efficiently.
In <a href="./bibliography.html#mexico-2016-bid40">[19]</a>, <a href="./bibliography.html#mexico-2016-bid41">[20]</a>, a novel approach to measure precision and generalization is presented, which relies on the notion of anti-alignments.
We propose metrics for precision and generalization that resemble the leave-one-out cross-validation techniques, where individual traces of the log are removed and the computed anti-alignment assess the model's capability to describe precisely or generalize the observed behavior.</p>
        <p>
          <span class="smallcap">Approaching the Coverability Problem Continuously </span>
        </p>
        <p>The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In <a href="./bibliography.html#mexico-2016-bid42">[13]</a>, we develop a new approach to this problem which is primarily based on applying forward coverability in continuous Petri nets as a pruning criterion inside a backward coverability framework. A cornerstone of our approach is the efficient encoding of a recently developed polynomial-time algorithm for reachability in continuous Petri nets into SMT. We demonstrate the effectiveness of our approach on standard benchmarks from the literature, which shows that our approach decides significantly more instances than any existing tool and is in addition often much faster, in particular on large instances.
</p>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid54.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid58.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
    </div>
  </body>
</html>
