A Maude-with-SMT framework for sound and complete formal analysis and parameter synthesis of parametric time Petri nets, including a folding approach that terminates on finite parametric state-class graphs and support for LTL model checking.
Liveness in L/U-Parametric Timed Automata
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.LO 3verdicts
UNVERDICTED 3representative citing papers
Presents parametric extrapolation for dense integer-complete underapproximation of parameter sets in bounded PTAs, with terminating algorithms for reachability and related properties.
Survey concluding that non-trivial problems on parametric timed automata are undecidable in general but decidable under restrictions on the number of clocks and the use of parameters.
citing papers explorer
-
A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
A Maude-with-SMT framework for sound and complete formal analysis and parameter synthesis of parametric time Petri nets, including a folding approach that terminates on finite parametric state-class graphs and support for LTL model checking.
-
Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
Presents parametric extrapolation for dense integer-complete underapproximation of parameter sets in bounded PTAs, with terminating algorithms for reachability and related properties.
-
What's decidable about parametric timed automata?
Survey concluding that non-trivial problems on parametric timed automata are undecidable in general but decidable under restrictions on the number of clocks and the use of parameters.