Parametric updates in parametric timed automata

DOI10.1007/978-3-030-21759-4_3OpenAlexW3101330757MaRDI QIDQ6149675

Étienne André, Mathias Ramparison, Didier Lime

Publication date: 6 February 2024

Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (1)

\textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Robust parametric reachability for timed automata
• Decision problems for lower/upper bound parametric timed automata
• What's decidable about hybrid automata?
• A theory of timed automata
• Linear parametric model checking of timed automata
• Updatable timed automata
• Advances in Parametric Real-Time Reasoning
• Language Emptiness of Continuous-Time Parametric Timed Automata
• Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points
• Parametric real-time reasoning
• Lectures on Concurrency and Petri Nets

This page was built for publication: Parametric updates in parametric timed automata