From Discrete Duration Calculus to Symbolic Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

From Discrete Duration Calculus to Symbolic Automata

Laure Gonnord
Nicolas Halbwachs
  • Function : Author
  • PersonId : 844681
Pascal Raymond


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.
Fichier principal
Vignette du fichier
slap04.pdf (237.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00198433 , version 1 (17-12-2007)



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. pp.3-18, ⟨10.1016/j.entcs.2006.02.022⟩. ⟨hal-00198433⟩
186 View
148 Download



Gmail Facebook Twitter LinkedIn More