HTML Export for FSFMA 2013

Copy to Clipboard Download

<h2>OASIcs, Volume 31, FSFMA 2013</h2>
<ul>
<li>
    <span class="authors">Christine Choppy and Jun Sun</span>
    <span class="title">OASIcs, Volume 31, FSFMA&#039;13, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013">10.4230/OASIcs.FSFMA.2013</a>
</li>
<li>
    <span class="authors">Christine Choppy and Jun Sun</span>
    <span class="title">Frontmatter, Table of Contents, Preface, Workshop Organization</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.i">10.4230/OASIcs.FSFMA.2013.i</a>
</li>
<li>
    <span class="authors">Laurent Fribourg</span>
    <span class="title">Control of Switching Systems by Invariance Analysis (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.1">10.4230/OASIcs.FSFMA.2013.1</a>
</li>
<li>
    <span class="authors">Wei-Ngan Chin</span>
    <span class="title">Specification, Verification and Inference (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.2">10.4230/OASIcs.FSFMA.2013.2</a>
</li>
<li>
    <span class="authors">Somsak Vanit-Anunchai</span>
    <span class="title">Analysis of Two-Layer Protocols: DCCP Simultaneous-Open and Hole Punching Procedures</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.3">10.4230/OASIcs.FSFMA.2013.3</a>
</li>
<li>
    <span class="authors">Étienne André</span>
    <span class="title">Dynamic Clock Elimination in Parametric Timed Automata</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.18">10.4230/OASIcs.FSFMA.2013.18</a>
</li>
<li>
    <span class="authors">Vladimir-Alexandru Paun, Bruno Monsuez, and Philippe Baufreton</span>
    <span class="title">On the Determinism of Multi-core Processors</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.32">10.4230/OASIcs.FSFMA.2013.32</a>
</li>
<li>
    <span class="authors">César Rodríguez and Stefan Schwoon</span>
    <span class="title">An Improved Construction of Petri Net Unfoldings</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.47">10.4230/OASIcs.FSFMA.2013.47</a>
</li>
<li>
    <span class="authors">Laurent Fribourg, Ulrich Kühne, and Romain Soulat</span>
    <span class="title">Constructing Attractors of Nonlinear Dynamical Systems</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.53">10.4230/OASIcs.FSFMA.2013.53</a>
</li>
<li>
    <span class="authors">Yan Liu</span>
    <span class="title">Formal Modelling and Verification of Pervasive Computing Systems</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.61">10.4230/OASIcs.FSFMA.2013.61</a>
</li>
<li>
    <span class="authors">Jonathan Protzenko</span>
    <span class="title">Illustrating the Mezzo programming language</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.68">10.4230/OASIcs.FSFMA.2013.68</a>
</li>
<li>
    <span class="authors">Martin Elshuber, Susanne Kandl, and Peter Puschner</span>
    <span class="title">Improving System-Level Verification of SystemC Models with SPIN</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.74">10.4230/OASIcs.FSFMA.2013.74</a>
</li>
<li>
    <span class="authors">Yanti Rusmawati and David Rydeheard</span>
    <span class="title">Modelling and Reasoning about Dynamic Networks as Concurrent Systems</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.80">10.4230/OASIcs.FSFMA.2013.80</a>
</li>
<li>
    <span class="authors">Patrice Carle, Christine Choppy, Romain Kervarc, and Ariane Piel</span>
    <span class="title">Safety of Unmanned Aircraft Systems Facing Multiple Breakdowns</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.FSFMA.2013.86">10.4230/OASIcs.FSFMA.2013.86</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode