Author of the publication

An Efficient Customized Clock Allocation Algorithm for a Class of Timed Automata.

, and . SBMF, volume 13768 of Lecture Notes in Computer Science, page 3-21. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Timed Scenarios: Consistency, Equivalence and Optimization., and . SBMF, volume 11254 of Lecture Notes in Computer Science, page 215-233. Springer, (2018)Synthesizing Timed Automata with Minimal Numbers of Clocks from Optimised Timed Scenarios., and . FORTE, volume 14678 of Lecture Notes in Computer Science, page 136-154. Springer, (2024)Readable, Runnable Requirements Specifications in SPILL-2., and . PLILP, volume 844 of Lecture Notes in Computer Science, page 449-450. Springer, (1994)From Scenarios to Timed Automata., and . SBMF, volume 10623 of Lecture Notes in Computer Science, page 33-51. Springer, (2017)Untangling the Graphs of Timed Automata to Decrease the Number of Clocks., and . IFM, volume 13274 of Lecture Notes in Computer Science, page 168-187. Springer, (2022)Clock Allocation in Timed Automata and Graph Colouring., and . HSCC, page 71-80. ACM, (2018)Optimization of Timed Scenarios., and . SBMF, volume 12475 of Lecture Notes in Computer Science, page 119-136. Springer, (2020)An Efficient Customized Clock Allocation Algorithm for a Class of Timed Automata., and . SBMF, volume 13768 of Lecture Notes in Computer Science, page 3-21. Springer, (2022)Minimization of the Number of Clocks for Timed Scenarios., and . SBMF, volume 13130 of Lecture Notes in Computer Science, page 122-139. Springer, (2021)Compile Time Garbage Collection for Ground Prolog.. ICLP/SLP, page 1490-1505. MIT Press, (1988)