Language Emptiness of Continuous-Time Parametric Timed Automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00081178" target="_blank" >RIV/00216224:14330/15:00081178 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-662-47666-6_6" target="_blank" >http://dx.doi.org/10.1007/978-3-662-47666-6_6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-47666-6_6" target="_blank" >10.1007/978-3-662-47666-6_6</a>

Result language
angličtina
Original language name
Language Emptiness of Continuous-Time Parametric Timed Automata
Original language description
Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various restricted subclasses. We thus focus on the case where parameters are assumed to be integer-valued, while the time still remains continuous. On the one hand, we show that the problem remains undecidable for parametric timed automata with three clocks and one parameter. On the other hand, for the case with arbitrary many clocks where only one of these clocks is compared with (an arbitrary number of) parameters, we show that the parametric language emptiness is decidable. The undecidability result tightens the bounds of a previous result which assumed six parameters, while the decidability result extends the existing approaches that deal with discrete-time semantics only.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

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

Similar results(10)