Dense integer-complete synthesis for bounded parametric timed automata

DOI10.46298/LMCS-22(2:11)2026MaRDI QIDQ7254987zbMATH OpenFDO

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

Publication date 29 May 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(2:11)2026

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
• A theory of timed automata
• Advances in Parametric Real-Time Reasoning
• AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
• Analysis of timed systems using time-abstracting bisimulations
• Better abstractions for timed automata
• Control of Real-Time Systems With Integer Parameters
• Decision problems for lower/upper bound parametric timed automata
• Durations and parametric model-checking in timed automata
• Efficient convex zone merging in parametric timed automata
• Formal modeling and analysis of timed systems. 16th international conference, FORMATS 2018, Beijing, China, September 4--6, 2018. Proceedings
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1956600 (Why is no real title available?)
• scientific article; zbMATH DE number 1444359 (Why is no real title available?)
• Integer-complete synthesis for bounded parametric timed automata
• Language emptiness of continuous-time parametric timed automata
• Language preservation problems in parametric timed automata
• Lectures on Concurrency and Petri Nets
• Linear parametric model checking of timed automata
• LTL parameter synthesis of parametric timed automata
• Model-checking in dense real-time
• Not necessarily closed convex polyhedra and the double description method
• Parametric real-time reasoning
• Parametric timing analysis for real-time systems
• Precise robustness analysis of time Petri nets with inhibitor ARCS
• Reachability and liveness in parametric timed automata
• Reachability in two-parametric timed automata with one parameter is expspace-complete
• Real-Time Model-Checking: Parameters everywhere
• Robust parametric reachability for timed automata
• Robustness in timed automata
• Romeo: a parametric model-checker for Petri nets with stopwatches
• Symbolic model checking for probabilistic timed automata
• Using non-convex approximations for efficient analysis of timed automata
• Zone-based verification of timed automata: extrapolations, simulations and what next?

This page was built for publication: Dense integer-complete synthesis for bounded parametric timed automata

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