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

Pol, Jaco van de; Petrucci, Laure

doi:10.1007/978-3-030-73785-6_1

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Preprint1

Book1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A previous proposal for Bounded Model Checking for PTA [21] considers the region graph and has not been implemented. We will provide several small illustrative examples inspired by the invited talk [26].…”

Section: Introductionmentioning

confidence: 99%

Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata

Pol¹,

Petrucci²,

Árias³

et al. 2021

Preprint

View full text Add to dashboard Cite

We study semi-algorithms to synthesise the constraints under which a Parametric Timed Automaton satisfies some liveness requirement. The algorithms traverse a possibly infinite parametric zone graph, searching for accepting cycles. We provide new search and pruning algorithms, leading to successful termination for many examples. We demonstrate the success and efficiency of these algorithms on a benchmark. We also illustrate parameter synthesis for the classical Bounded Retransmission Protocol. Finally, we introduce a new notion of completeness in the limit, to investigate if an algorithm enumerates all solutions.

show abstract

Section: Introductionmentioning

confidence: 99%