TCTL model checking lower/upper-bound parametric timed automata without invariants

DOI10.1007/978-3-030-00151-3_3MaRDI QIDQ1631215zbMATH OpenOpenAlexFDO

Authors Étienne André, Didier Lime, Mathias Ramparison

Publication date 6 December 2018

Full work available at URL https://doi.org/10.1007/978-3-030-00151-3_3

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Decision Problems for Lower/Upper Bound Parametric Timed Automata
• Decision problems for lower/upper bound parametric timed automata
• Linear parametric model checking of timed automata
• scientific article; zbMATH DE number 1701759
• What's decidable about parametric timed automata?

Cited in

(12)

• MTL-model checking of one-clock parametric timed automata is undecidable
• Decision problems for lower/upper bound parametric timed automata
• Linear parametric model checking of timed automata
• Decision Problems for Lower/Upper Bound Parametric Timed Automata
• Language preservation problems in parametric timed automata
• Parametric schedulability analysis of a launcher flight control system under reactivity constraints
• What's decidable about parametric timed automata?
• On the expressiveness of parametric timed automata
• Towards Bounded Model Checking for the Universal Fragment of TCTL
• scientific article; zbMATH DE number 7350779 (Why is no real title available?)
• scientific article; zbMATH DE number 7566044 (Why is no real title available?)
• scientific article; zbMATH DE number 1701759 (Why is no real title available?)

This page was built for publication: TCTL model checking lower/upper-bound parametric timed automata without invariants

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