Minimization of the Number of Clocks for Timed Scenarios

  • Neda Saeedloei Towson University
  • Feliks  KluŹniak LogicBlox

Resumo


We present a new optimization algorithm for timed scenarios that achieves the minimal number of clocks when timed scenarios are viewed as timed automata.
Publicado
07/12/2021
SAEEDLOEI, Neda;  KLUŹNIAK, Feliks. Minimization of the Number of Clocks for Timed Scenarios. In: SIMPÓSIO BRASILEIRO DE MÉTODOS FORMAIS (SBMF), 24. , 2021, Campina Grande. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2021 . p. 122-139.