Clock Allocation in Timed Automata and Graph Colouring

DOI10.1145/3178126.3178138zbMath1409.68162OpenAlexW2795457160MaRDI QIDQ4561434

Neda Saeedloei, Feliks Kluźniak

Publication date: 6 December 2018

Published in: Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3178126.3178138

zbMATH Keywords

timed automatagraph colouringoptimal clock allocation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Minimization of the number of clocks for timed scenarios ⋮ Untangling the graphs of timed automata to decrease the number of clocks ⋮ An efficient customized clock allocation algorithm for a class of timed automata

This page was built for publication: Clock Allocation in Timed Automata and Graph Colouring