Robust parametric reachability for timed automata

DOI10.1016/j.ipl.2006.11.018zbMath1184.68337OpenAlexW2077321406MaRDI QIDQ846009

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

verificationrobustnessreal-time systemsmodel checkingformal methodstheory of computationparametric timed automata

Mathematics Subject Classification ID

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

Related Items (13)

Language Emptiness of Continuous-Time Parametric Timed Automata ⋮ Verification of Hybrid Systems ⋮ Parameter synthesis for probabilistic timed automata using stochastic game abstractions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parametric updates in parametric timed automata ⋮ On parametric timed automata and one-counter machines ⋮ The language preservation problem is undecidable for parametric event-recording automata ⋮ Unnamed Item ⋮ What’s Decidable About Parametric Timed Automata? ⋮ Consistency in parametric interval probabilistic timed automata ⋮ AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA ⋮ Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques

Cites Work

• A theory of timed automata
• Linear parametric model checking of timed automata
• The benefits of relaxing punctuality
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Parametric real-time reasoning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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