HAL : hal-00198433, version 1

DOI : 10.1016/j.entcs.2006.02.022

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

Third International Workshop on Synchronous Languages, Applications, and Programs (SLAP 2004), Barcelona : Spain (2003)

From Discrete Duration Calculus to Symbolic Automata

Laure Gonnord 1, Nicolas Halbwachs 1, Pascal Raymond

(15/06/2006)

The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are written in the synchronous programming language Lustre, in order to allow available symbolic verification tools (model-checkers, abstract interpreters) to be applied to properties expressed in QDDC. We show that important constructs of QDDC need non-deterministic acceptors, in order to be translated with a bounded number of counters, and an expressive fragment of the logic is identified and translated. Then, we consider a more restricted fragment, which only needs deterministic acceptors.

1 :	VERIMAG (VERIMAG - IMAG)
	CNRS : UMR5104 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG)

Domaine

:

Informatique/Systèmes embarqués Informatique/Génie logiciel

Mots Clés : Duration Calculus – QDDC – synchronous observers – non-deterministic observers – Lustre

hal-00198433, version 1

http://hal.archives-ouvertes.fr/hal-00198433

oai:hal.archives-ouvertes.fr:hal-00198433

Contributeur : Nicolas Halbwachs <>

Soumis le : Lundi 17 Décembre 2007, 11:58:04

Dernière modification le : Lundi 17 Décembre 2007, 20:38:09