Summary: A Symbolic Model checker for tccp Programs #
M. Alpuente 1 , M. Falaschi 2 , and A. Villanueva 1
1 DSIC, Technical University of Valencia,
Camino de Vera s/n, E­46022 Valencia, Spain
2 DIMI, University of Udine,
Via delle Scienze 206, I­33100 Udine, Italy
Abstract In this paper, we develop a symbolic representation for timed
concurrent constraint (tccp) programs, which can be used for defining
a lightweight model--checking algorithm for reactive systems. Our ap­
proach is based on using streams to extend Di#erence Decision Dia­
grams (DDDs) which generalize the classical Binary Decision Diagrams
(BDDs) with constraints. We use streams to model the values of system
variables along the time, as occurs in many other (declarative) languages.
Then, we define a symbolic (finite states) model checking algorithm for
tccp which mitigates the state explosion problem that is common to more
conventional model checking approaches. We show how the symbolic ap­
proach to model checking for tccp improves previous approaches based
on the classical Linear Time Logic (LTL) model checking algorithm.
Keywords: Lightweight formal methods, Model Checking, Timed Con­
current Constraint Programs, DDDs

Source: Alpuente, María - Departamento de Sistemas Informáticos y Computación, Universitat Politècnica de València

Collections: Computer Technologies and Information Sciences