Verification of Timed Automata Using Rewrite Rules and Strategies
| dc.creator | Beffara, Emmanuel | |
| dc.creator | Bournez, Olivier | |
| dc.creator | Kacem, Hassen | |
| dc.creator | Kirchner, Claude | |
| dc.date | 2001-09-17 | |
| dc.date.accessioned | 2026-07-07T03:17:31Z | |
| dc.date.available | 2026-07-07T03:17:31Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0109024 | |
| dc.identifier | http://arxiv.org/abs/cs/0109024 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30747 | |
| dc.subject | Programming Languages | |
| dc.subject | I.2.3 | |
| dc.title | Verification of Timed Automata Using Rewrite Rules and Strategies | |
| dc.type | text |