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.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download
Contributor : Nicolas Halbwachs <>
Submitted on : Monday, December 17, 2007 - 11:58:04 AM
Last modification on : Sunday, March 17, 2019 - 8:58:07 AM
Long-term archiving on : Monday, April 12, 2010 - 8:08:50 AM


Files produced by the author(s)




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⟩



Record views


Files downloads