From scenarios to timed automata

DOI10.1007/978-3-319-70848-5_4zbMATH Open1498.68170OpenAlexW2768054586MaRDI QIDQ5045458FDOQ5045458

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

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

zbMATH Keywords

scenariostimed automataformal models

Mathematics Subject Classification ID

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

Cited In (10)

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