Verification of Timed Automata Using Rewrite Rules and Strategies

Emmanuel Beffara, Olivier Bournez, Hassen Kacem +1

ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. Timed automata is a clas…