On Completeness of Liveness Synthesis for Parametric Timed Automata (Extended Abstract)

Jaco van de Pol,Laure Petrucci

On Completeness of Liveness Synthesis for Parametric Timed Automata (Extended Abstract)

2021

Jaco van de Pol
Laure Petrucci

We discuss what kind of completeness guarantees can be provided by semi-algorithms for the synthesis of the set of parameters under which a parametric timed automata meets some liveness property.

Keywords:

Parametric statistics
Automaton
Liveness
Theoretical computer science
Completeness (order theory)
Computer science

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations