Decision Problems for Parametric Timed Automata

Parametric timed automata (PTAs) allow to reason on systems featuring concurrency and timing constraints making use of parameters. Most problems are undecidable for PTAs, including the parametric reachability emptiness problem, i.e., whether at least one parameter valuation allows to reach some disc...

Full description

Saved in:
Bibliographic Details
Published inFormal Methods and Software Engineering Vol. 10009; pp. 400 - 416
Main Authors André, Étienne, Lime, Didier, Roux, Olivier H.
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 01.01.2016
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Computer programming / software development
Concrete State
Integer Point
Parameter Valuation
Programming & scripting languages: general
Software Engineering
Symbolic State
Syntactic Restriction
Online AccessGet full text
ISBN9783319478456
3319478451
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-47846-3_25

Cover

More Information
Summary:Parametric timed automata (PTAs) allow to reason on systems featuring concurrency and timing constraints making use of parameters. Most problems are undecidable for PTAs, including the parametric reachability emptiness problem, i.e., whether at least one parameter valuation allows to reach some discrete state. In this paper, we first exhibit a subclass of PTAs (namely integer-points PTAs) with bounded rational-valued parameters for which the parametric reachability emptiness problem is decidable. Second, we present further results improving the boundary between decidability and undecidability for PTAs and their subclasses.
Bibliography:This work is partially supported by the ANR national research program “PACS” (ANR-14-CE28-0002).
ISBN:9783319478456
3319478451
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-47846-3_25