Verification of Timed Automata Using Rewrite Rules and Strategies

Emmanuel Beffara 1 Olivier Bournez 1 Hassen Kacem 1 Claude Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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 class of continuous real-time models of reactive systems for which efficient model-checking algorithms have been devised. In this paper, we show that these algorithms can very easily be prototyped in the ELAN system. This paper argues through this example that rewriting based systems relying on rules and strategies are a good framework to prototype, study and test rather efficiently symbolic model-checking algorithms, i.e. algorithms which involve combination of graph exploration rules, deduction rules, constraint solving techniques and decision procedures.
Type de document :
Communication dans un congrès
The Seventh Biennal Bar-Ilan Symposium on the Foundations of Artificial Intelligence - BISFAI'01, Jun 2001, Bar-Ilan University, Ramat-Gan, Israel, 15 p, 2001
Liste complète des métadonnées

https://hal.inria.fr/inria-00100535
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:46:31
Dernière modification le : jeudi 11 janvier 2018 - 06:19:57

Identifiants

  • HAL Id : inria-00100535, version 1

Collections

Citation

Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner. Verification of Timed Automata Using Rewrite Rules and Strategies. The Seventh Biennal Bar-Ilan Symposium on the Foundations of Artificial Intelligence - BISFAI'01, Jun 2001, Bar-Ilan University, Ramat-Gan, Israel, 15 p, 2001. 〈inria-00100535〉

Partager

Métriques

Consultations de la notice

85