Execution-time opacity problems in one-clock parametric timed automata

DOI10.4230/LIPICS.FSTTCS.2024.3MaRDI QIDQ7263557zbMATH OpenFDO

Authors Étienne André, Johan Arcile, Engel Lefaucheux

Publication date 12 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2024.3

zbMATH Keywords

parametric timed automataPresburger arithmetictimed opacity

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A theory of timed automata
• Decidability of the initial-state opacity of real-time automata
• Durations and parametric model-checking in timed automata
• From finite automata to regular expressions and back -- a summary on descriptional complexity
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1444359 (Why is no real title available?)
• Language emptiness of continuous-time parametric timed automata
• Language preservation problems in parametric timed automata
• Linear parametric model checking of timed automata
• Non-interference control synthesis for security timed automata
• On parametric timed automata and one-counter machines
• On the complexity of linear arithmetic with divisibility
• Parametric real-time reasoning
• Reachability in two-parametric timed automata with one parameter is expspace-complete
• Real-time automata

Cited in

(1)

• The bright side of timed opacity

This page was built for publication: Execution-time opacity problems in one-clock parametric timed automata

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