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.
Timed State Spac e Analysis of Real-Time Preemptive Systems
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
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.
Waiting nets extend time Petri nets by decoupling time measurement from control, admit finite state class graphs for bounded instances, and are strictly more expressive than TPNs under timed language equivalence.
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.
-
Waiting Nets: State Classes and Taxonomy
Waiting nets extend time Petri nets by decoupling time measurement from control, admit finite state class graphs for bounded instances, and are strictly more expressive than TPNs under timed language equivalence.