On the expressiveness of parametric timed automata

DOI10.1007/978-3-319-44878-7_2zbMATH Open1433.68227OpenAlexW2518552594MaRDI QIDQ4603554FDOQ4603554

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

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

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)

Cited In (13)

• Timed recursive state machines: expressiveness and complexity
• Parametric updates in parametric timed automata
• Context-free timed formalisms: robust automata and linear temporal logics
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)