Decision Problems for Lower/Upper Bound Parametric Timed Automata

DOI10.1007/978-3-540-73420-8_79MaRDI QIDQ5428870zbMATH OpenOpenAlexFDO

Authors Laura Bozzelli, Salvatore La Torre

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_79

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Decision problems for lower/upper bound parametric timed automata
• TCTL model checking lower/upper-bound parametric timed automata without invariants
• Linear parametric model checking of timed automata
• Linear parametric model checking of timed automata
• What's decidable about parametric timed automata?

Cited in

(6)

• Decision problems for lower/upper bound parametric timed automata
• TCTL model checking lower/upper-bound parametric timed automata without invariants
• Linear parametric model checking of timed automata
• Linear parametric model checking of timed automata
• MTL-model checking of one-clock parametric timed automata is undecidable
• Reachability and liveness in parametric timed automata

This page was built for publication: Decision Problems for Lower/Upper Bound Parametric Timed Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428870)