Verifying real-time properties by intelligent parsing

In this paper we present a syntax-directed approach to the verification of timing properties in systems like control systems, real-time systems, communication networks etc. Such systems, if modelled as timed automata [1], can be easily described through formal grammars (automata are transformed into grammars) and then analyzed by a parsing algorithm. In order to optimize the verification process, we embedded this approach in the constraint logic programming paradigm where the implementation of the grammar and of the parsing method can be specified as a set of deductive rules. Furthermore, we report about the possibility of using a special class of such rules - called propagation rules - in the verification of real-time properties.