From scenarios to timed automata

DOI10.1007/978-3-319-70848-5_4MaRDI QIDQ5045458zbMATH OpenOpenAlexFDO

Authors Neda Saeedloei, Feliks Kluźniak

Publication date 4 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-70848-5_4

zbMATH Keywords

formal modelsscenariostimed automata

Mathematics Subject Classification ID

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

Recommendations

• Synthesizing Clock-Efficient Timed Automata
• Timed scenarios: consistency, equivalence and optimization
• Synthesis from scenario-based specifications
• scientific article; zbMATH DE number 1507209
• scientific article; zbMATH DE number 2102690

Cited in

(11)

• Automatic synthesis of a subclass of schedulers in timed systems.
• Minimization of the number of clocks for timed scenarios
• Predictable real-time software synthesis
• Generating FSMs from interworkings
• CONCUR 2004 - Concurrency Theory
• Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning
• An efficient customized clock allocation algorithm for a class of timed automata
• Timed scenarios: consistency, equivalence and optimization
• Synthesizing Clock-Efficient Timed Automata
• Operations on timed scenarios
• On the existence of unions of timed scenarios

This page was built for publication: From scenarios to timed automata

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