Similar Items: Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
- Parametric updates in parametric timed automata
- Reachability and liveness in parametric timed automata
- Language Preservation Problems in Parametric Timed Automata
- On completeness and parametricity in the realizability semantics of System F
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Minimization of visibly pushdown automata is NP-complete