What’s decidable about parametric timed automata?

Parametric timed automata (PTAs) are a powerful formalism to reason, simulate and formally verify critical real-time systems. After 25 years of research on PTAs, it is now well understood that any non-trivial problem studied is undecidable for general PTAs. We provide here a survey of decision and c...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal on software tools for technology transfer Jg. 21; H. 2; S. 203 - 219
1. Verfasser:	André, Étienne
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2019 Springer Nature B.V Springer Verlag
Schlagworte:	Clocks Computer Science Computer simulation Formal Languages and Automata Theory Formalism Logic in Computer Science Lower bounds Parameters Regular Paper Software Engineering Software Engineering/Programming and Operating Systems Theory of Computation Parametric timed model checking L/U-PTAs Hybrid automata Decidability Parameter synthesis Decision problems hybrid systems Parametric timed automata Model checking Parametric model checking
ISSN:	1433-2779, 1433-2787
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!