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”

LTL Parameter Synthesis of Parametric Timed Automata

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00088058" target="_blank" >RIV/00216224:14330/16:00088058 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    LTL Parameter Synthesis of Parametric Timed Automata

  • Original language description

    The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valua- tions under which the parameter synthesis problem is decidable for LTL properties. The investigated bounded integer parameter synthesis prob- lem could be solved using an explicit enumeration of all possible parame- ter valuations. We propose an alternative symbolic zone-based method for this problem which results in a faster computation. Our technique extends the ideas of the automata-based approach to LTL model check- ing of timed automata. To justify the usefulness of our approach, we provide experimental evaluation and compare our method with explicit enumeration technique.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA15-11089S" target="_blank" >GA15-11089S: Parameter Discovery for Biological Models Using Model Checking</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • 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

    Software Engineering and Formal Methods - 14th International Conference, SEFM 2016.

  • ISBN

    9783319415901

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    16

  • Pages from-to

    172-187

  • Publisher name

    Lecture Notes in Computer Sciences in Computer Science, 9763

  • Place of publication

    Berlin

  • Event location

    Vienna

  • Event date

    Jul 4, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article