Some Progress in the Symbolic Verification of Timed Automata
Résumé
In this paper we discuss the practical difficulty of analyzing the behavior of timed automata and report some results obtained using an experimental BDD-based extension of KRONOS. We have treated examples originating from timing analysis of asynchronous boolean networks and CMOS circuits with delay uncertainties and the results outperform those obtained by previous implementation of timed automata verification tools.
Domaines
Systèmes embarqués
Origine : Fichiers produits par l'(les) auteur(s)
Loading...