| | |
Summary: A Semantic Framework for the Abstract Model Checking
of tccp programs #
M. Alpuente M.M. Gallardo, E. Pimentel A. Villanueva
U. Polit’ecnica de Valencia U. de M’alaga U. Polit’ecnica de Valencia
Camino de Vera s/n Campus de Teatinos s/n Camino de Vera s/n
46022 Valencia 29071 M’alaga 46022 Valencia
alpuente@dsic.upv.es {gallardo,ernesto}@lcc.uma.es villanue@dsic.upv.es
Abstract
The Timed Concurrent Constraint program
ming language (tccp) introduces time aspects
into the Concurrent Constraint paradigm.
This makes tccp especially appropriate for an
alyzing timing properties of concurrent sys
tems by model checking. However, even if
very compact state representations are ob
tained thanks to the use of constraints in tccp,
large state spaces can still be generated, which
may prevent modelchecking tools from verify
ing tccp programs completely. In this work, we
introduce an abstract methodology which is
|
