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”

Discrete and Continuous Strategies for Timed-Arc Petri Net Games

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="http://dx.doi.org/10.1007/s10009-017-0473-2" target="_blank" >http://dx.doi.org/10.1007/s10009-017-0473-2</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s10009-017-0473-2" target="_blank" >10.1007/s10009-017-0473-2</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Discrete and Continuous Strategies for Timed-Arc Petri Net Games

  • Original language description

    Automatic strategy synthesis for a given control objective can be used to generate correct-by-construction controllers of real-time reactive systems. The existing symbolic approach for continuous timed game is a computationally hard task and current tools like UPPAAL TiGa often scale poorly with the model complexity. We suggest an explicit approach for strategy synthesis in the discrete-time setting and show that even for systems with closed guards, the existence of a safety discrete-time strategy does not imply the existence of a safety continuous-time strategy and vice versa. Nevertheless, we prove that the answers to the existence of discrete-time and continuous-time safety strategies coincide on a practically motivated subclass of urgent controllers that either react immediately after receiving an environmental input or wait with the decision until a next event is triggered by the environment. We then develop an on-the-fly synthesis algorithm for discrete timed-arc Petri net games. The algorithm is implemented in our tool TAPAAL, and based on the experimental evidence, we discuss the advantages of our approach compared to the symbolic continuous-time techniques.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

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

  • Name of the periodical

    International Journal on Software Tools for Technology Transfer (STTT)

  • ISSN

    1433-2779

  • e-ISSN

    1433-2787

  • Volume of the periodical

    20

  • Issue of the periodical within the volume

    5

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    18

  • Pages from-to

    529-546

  • UT code for WoS article

    000441949300004

  • EID of the result in the Scopus database

    2-s2.0-85029818811