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...

Full description

Saved in:

Bibliographic Details
Published in:	International journal on software tools for technology transfer Vol. 21; no. 2; pp. 203 - 219
Main Author:	André, Étienne
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2019 Springer Nature B.V Springer Verlag
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!