@inproceedings{10.1007/978-3-030-63461-2_15,
Abstract = {We describe a new approach to synthesizing a timed automaton from a set of timed scenarios. The set of scenarios specifies a set of behaviours, i.e., sequences of events that satisfy the time constraints imposed by the scenarios. The language of the constructed automaton is equivalent to that set of behaviours. Every location of the automaton appears in at least one accepting run, and its graph is constructed so as to minimise the number of clocks. The construction allows a new clock allocation algorithm whose cost is linear in the number of edges.},
Address = {Cham},
Author = {Saeedloei, Neda and Klu{\'{z}}niak, Feliks},
BookTitle = {Integrated Formal Methods},
Editor = {Dongol, Brijesh and Troubitsyna, Elena},
ISBN = {978-3-030-63461-2},
Pages = {276--294},
Publisher = {Springer International Publishing},
Title = {Synthesizing Clock-Efficient Timed Automata},
Year = {2020},
date-added = {2021-05-24 16:03:54 +0200},
date-modified = {2021-05-24 16:03:54 +0200},
doi = {10.1007/978-3-030-63461-2_15}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A