## TAGED Approximations for Temporal Properties Model-Checking

Citations: | 1 - 0 self |

### BibTeX

@MISC{Courbis_tagedapproximations,

author = {R. Courbis and P.-C. Héam and O. Kouchnarenko},

title = {TAGED Approximations for Temporal Properties Model-Checking },

year = {}

}

### OpenURL

### Abstract

This paper investigates the use of tree automata with global equalities and disequalities (TAGED for short) in reachability analysis over term rewriting systems (TRSs). The reachability problem being in general undecidable on non terminating TRSs, we provide TAGED-based construction, and then design approximation-based semi-decision procedures to model-check useful temporal patterns on in nite state rewriting graphs. To show that the above TAGED-based construction can be e ectively carried out, complexity analysis for rewriting TAGEDde nable languages is given.