From Discrete Duration Calculus to Symbolic Automata

Abstract : 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.
Type de document :
Communication dans un congrès
Third International Workshop on Synchronous Languages, Applications, and Programs (SLAP 2004), Mar 2003, Barcelona, Spain. 153 (4), pp.3-18, 2006, 〈10.1016/j.entcs.2006.02.022〉
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00198433
Contributeur : Nicolas Halbwachs <>
Soumis le : lundi 17 décembre 2007 - 11:58:04
Dernière modification le : mardi 27 février 2018 - 10:36:02
Document(s) archivé(s) le : lundi 12 avril 2010 - 08:08:50

Fichier

slap04.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

IMAG | UGA

Citation

Laure Gonnord, Nicolas Halbwachs, Pascal Raymond. From Discrete Duration Calculus to Symbolic Automata. Third International Workshop on Synchronous Languages, Applications, and Programs (SLAP 2004), Mar 2003, Barcelona, Spain. 153 (4), pp.3-18, 2006, 〈10.1016/j.entcs.2006.02.022〉. 〈hal-00198433〉

Partager

Métriques

Consultations de la notice

187

Téléchargements de fichiers

131