On the expressiveness of parametric timed automata

DOI10.1007/978-3-319-44878-7_2MaRDI QIDQ4603554zbMATH OpenOpenAlexFDO

Authors Étienne André, Didier Lime, Olivier H. Roux

Publication date 16 February 2018

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44878-7_2

zbMATH Keywords

parametric timed automatahidden parametersL/U-PTAS

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• What's decidable about parametric timed automata?
• TCTL model checking lower/upper-bound parametric timed automata without invariants
• Language preservation problems in parametric timed automata
• Language preservation problems in parametric timed automata
• Integer Parameter Synthesis for Timed Automata

Cited in

(13)

• Timed recursive state machines: expressiveness and complexity
• Context-free timed formalisms: robust automata and linear temporal logics
• Parametric updates in parametric timed automata
• scientific article; zbMATH DE number 1759410 (Why is no real title available?)
• Language preservation problems in parametric timed automata
• Language preservation problems in parametric timed automata
• What's decidable about parametric timed automata?
• Parameter Synthesis for Timed Kripke Structures
• Consistency in parametric interval probabilistic timed automata
• AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
• Integer Parameter Synthesis for Timed Automata
• scientific article; zbMATH DE number 7566044 (Why is no real title available?)
• On parametric timed automata and one-counter machines

This page was built for publication: On the expressiveness of parametric timed automata

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