Verification of Timed Automata Using Rewrite Rules and Strategies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Verification of Timed Automata Using Rewrite Rules and Strategies

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.
Not file

Dates and versions

inria-00100534 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100534 , version 1

Cite

Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner. Verification of Timed Automata Using Rewrite Rules and Strategies. ERCIM Working Group on Constraints, Jun 2001, Prague, Czech Republic, 15 p. ⟨inria-00100534⟩
72 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More