Robust parametric reachability for timed automata

DOI10.1016/J.IPL.2006.11.018zbMATH Open1184.68337OpenAlexW2077321406MaRDI QIDQ846009FDOQ846009

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

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

zbMATH Keywords

verificationrobustnessmodel checkingformal methodsreal-time systemstheory of computationparametric timed automata

Mathematics Subject Classification ID

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

Cites Work

• A theory of timed automata
• Title not available (Why is that?)
• The benefits of relaxing punctuality
• Parametric real-time reasoning
• Linear parametric model checking of timed automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Cited In (17)

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

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)