Fast detection of cycles in timed automata Abstract: We will present an algorithm to detect if a cycle in a timed automaton can be iterated infinitely often. Existing solutions in tools have a complexity which is exponential in the number … Continue reading →
Referent: Dipl.-Inform. Ibtissem Ben Makhlouf Titel: Comparative Evaluation and Improvement of Computational Approaches to Reachability Analysis of Linear Hybrid Systems Abstract: Hybrid systems combine discrete events and continuous behaviors in the same framework. The discrete part is represented as transitions between … Continue reading →