All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F18%3A00106625" target="_blank" >RIV/00216224:14330/18:00106625 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007%2F978-3-319-96145-3_28" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-319-96145-3_28</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-96145-3_28" target="_blank" >10.1007/978-3-319-96145-3_28</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems

  • Original language description

    Partial order reduction for timed systems is a challenging topic due to the dependencies among events induced by time acting as a global synchronization mechanism. So far, there has only been a limited success in finding practically applicable solutions yielding significant state space reductions. We suggest a working and efficient method to facilitate stubborn set reduction for timed systems with urgent behaviour. We first describe the framework in the general setting of timed labelled transition systems and then instantiate it to the case of timed-arc Petri nets. The basic idea is that we can employ classical untimed partial order reduction techniques as long as urgent behaviour is enforced. Our solution is implemented in the model checker TAPAAL and the feature is now broadly available to the users of the tool. By a series of larger case studies, we document the benefits of our method and its applicability to real-world scenarios.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 30th International Conference on Computer Aided Verification (CAV'18)

  • ISBN

    9783319961446

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    20

  • Pages from-to

    527-546

  • Publisher name

    Springer

  • Place of publication

    Netherlands

  • Event location

    UK

  • Event date

    Jan 1, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000491481600028