Application of parametric model checking - the Root Contention protocol

Bandini, Gianfranco; Spelberg, R.L.; Rooij, R.C.H. de; Toetenel, W.J.

doi:10.1109/hicss.2001.927265

Cited by 5 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To mitigate the limitations of the TA-based approach, parametric timed automata (PTAs) are proposed [7,11,12,26], which allow more general constraints on invariants of notes (or states) and guards of edges (or transitions) of an automaton. Informally, a clock x of a PTA A is called a parametrically constrained clock if x and some parameters both occur in a constraint of A.…”

Section: Decidable Parametric Timed Automatamentioning

confidence: 99%

Parameter Synthesis Problems for one parametric clock Timed Automata

Dai,

Chen,

Liu

et al. 2018

Preprint

View full text Add to dashboard Cite

In this paper, we study the parameter synthesis problem for a class of parametric timed automata. The problem asks to construct the set of valuations of the parameters in the parametric timed automaton, referred to as the feasible region, under which the resulting timed automaton satisfies certain properties. We show that the parameter synthesis problem of parametric timed automata with only one parametric clock (unlimited concretely constrained clock) and arbitrarily many parameters is solvable when all the expressions are linear expressions. And it is moreover the synthesis problem is solvable when the form of constraints are parameter polynomial inequality not just simple constraint and parameter domain is nonnegative real number.

show abstract

Section: Decidable Parametric Timed Automatamentioning

confidence: 99%

Parameter Synthesis Problems for one parametric clock Timed Automata

Dai,

Chen,

Liu

et al. 2018

Preprint

View full text Add to dashboard Cite

show abstract

“…The constraint synthesis problem is related to our universality problem: given a parametric real-time system and formula, derive the most-general constraints over parameters that make the model-checking problem successful. This problem is studied in [4,9,10,14,15,18,21,29,30,32]. Although the constraint-synthesis problem for timed CTL with parameters appearing only in formulas is decidable, the same does not hold for timed automaton with parameters in general.…”

Section: Introductionmentioning

confidence: 99%