HTML Export for LITES, Volume 3, Issue 1

Copy to Clipboard Download

<h2>Leibniz Transactions on Embedded Systems, Volume 3, Issue 1, </h2>
<ul>
<li>
    <span class="title">LITES, Volume 3, Issue 1</span>
    <a class="doi" href="https://doi.org/10.4230/LITES-v003-i001">10.4230/LITES-v003-i001</a>
</li>
<li>
    <span class="authors">Christina Houben and Sebastian Houben</span>
    <span class="title">Programming Language Constructs Supporting Fault Tolerance</span>
    <a class="doi" href="https://doi.org/10.4230/LITES-v003-i001-a001">10.4230/LITES-v003-i001-a001</a>
</li>
<li>
    <span class="authors">Risat Mahmud Pathan</span>
    <span class="title">Real-Time Scheduling on Uni- and Multiprocessors based on Priority Promotions</span>
    <a class="doi" href="https://doi.org/10.4230/LITES-v003-i001-a002">10.4230/LITES-v003-i001-a002</a>
</li>
<li>
    <span class="authors">Matthieu Moy, Claude Helmstetter, Tayeb Bouhadiba, and Florence Maraninchi</span>
    <span class="title">Modeling Power Consumption and Temperature in TLM Models</span>
    <a class="doi" href="https://doi.org/10.4230/LITES-v003-i001-a003">10.4230/LITES-v003-i001-a003</a>
</li>
<li>
    <span class="authors">Joël Goossens and Pascal Richard</span>
    <span class="title">Optimal Scheduling of Periodic Gang Tasks</span>
    <a class="doi" href="https://doi.org/10.4230/LITES-v003-i001-a004">10.4230/LITES-v003-i001-a004</a>
</li>
<li>
    <span class="authors">Mingsong Lv, Nan Guan, Jan Reineke, Reinhard Wilhelm, and Wang Yi</span>
    <span class="title">A Survey on Static Cache Analysis for Real-Time Systems</span>
    <a class="doi" href="https://doi.org/10.4230/LITES-v003-i001-a005">10.4230/LITES-v003-i001-a005</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