Verification of Timed Automata Using Rewrite Rules and Strategies

Details Verification of Timed Automata Using Rewrite Rules and Strategies Verification of Timed Automata Using Rewrite Rules and Strategies

2001-09-17

arxiv.org/abs/cs/0109024v1

Computer Science

Programming Languages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Verification of Timed Automata Using Rewrite Rules and Strategies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Verification of Timed Automata Using Rewrite Rules and Strategies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Verification of Timed Automata Using Rewrite Rules and Strategies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-132506