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.

Reference:

@inproceedings{
author = {L. Gonnord and N. Halbwachs and P. Raymond},
title = {From Discrete Duration Calculus to Symbolic Automata},
booktitle={3rd International Workshop on Synchronous Languages, Applications,
and Programs, SLAP'04},
address={Barcelona, Spain},
month=mar,
year=2004
}

PDF file