Robust parametric reachability for timed automata

DOI10.1016/J.IPL.2006.11.018MaRDI QIDQ846009zbMATH OpenOpenAlexFDO

Authors Laurent Doyen

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.11.018

zbMATH Keywords

verificationrobustnessmodel checkingformal methodsreal-time systemstheory of computationparametric timed automata

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Advances in Parametric Real-Time Reasoning
• Parametric Interrupt Timed Automata
• scientific article; zbMATH DE number 1444359
• scientific article; zbMATH DE number 7297846
• On parametric timed automata and one-counter machines

Cites work

• scientific article; zbMATH DE number 1962855 (Why is no real title available?)
• scientific article; zbMATH DE number 2085321 (Why is no real title available?)
• scientific article; zbMATH DE number 1405643 (Why is no real title available?)
• scientific article; zbMATH DE number 1444359 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A theory of timed automata
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Linear parametric model checking of timed automata
• Parametric real-time reasoning
• The benefits of relaxing punctuality

Cited in

(17)

• AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
• Parametric updates in parametric timed automata
• Robust Controller Synthesis in Timed Automata
• Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
• Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete
• Consistency in parametric interval probabilistic timed automata
• scientific article; zbMATH DE number 7350779 (Why is no real title available?)
• Verification of Hybrid Systems
• Parameter synthesis for probabilistic timed automata using stochastic game abstractions
• On parametric timed automata and one-counter machines
• Reachability solution characterization of parametric real-time systems
• Language emptiness of continuous-time parametric timed automata
• Language preservation problems in parametric timed automata
• scientific article; zbMATH DE number 1444348 (Why is no real title available?)
• The language preservation problem is undecidable for parametric event-recording automata
• scientific article; zbMATH DE number 7566044 (Why is no real title available?)
• What's decidable about parametric timed automata?

This page was built for publication: Robust parametric reachability for timed automata

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