Synthesizing Clock-Efficient Timed Automata

DOI10.1007/978-3-030-63461-2_15MaRDI QIDQ6487932zbMATH OpenFDO

Authors Neda Saeedloei, Feliks Kluźniak

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-63461-2_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• From scenarios to timed automata
• Timed scenarios: consistency, equivalence and optimization
• Clock allocation in timed automata and graph colouring
• Template-based controller synthesis for timed systems
• On clock-aware LTL parameter synthesis of timed automata

Cited in

(12)

• Optimization of timed scenarios
• Minimization of the number of clocks for timed scenarios
• Untangling the graphs of timed automata to decrease the number of clocks
• Clock allocation in timed automata and graph colouring
• scientific article; zbMATH DE number 2143087 (Why is no real title available?)
• From scenarios to timed automata
• Towards an Efficient Tree Automata based technique for Timed Systems
• Integer Parameter Synthesis for Timed Automata
• The efficiency of identifying timed automata and the power of clocks
• An efficient customized clock allocation algorithm for a class of timed automata
• Timed scenarios: consistency, equivalence and optimization
• Operations on timed scenarios

This page was built for publication: Synthesizing Clock-Efficient Timed Automata

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