View article

The timed synchronous dataflow graph model is a graphical model of computation that allows concurrency between processes. This model is widely used due to its expressive power, semantic simplicity and predefined properties. However, the lack of support for formal verification makes it difficult to manually verify user-defined properties, even for small-sized graphs. This paper presents a formal verification solution of timed synchronous dataflow graphs based on the Lustre language and model checking. The solution consists in an automatic translation of synchronous dataflow graphs into Lustre code and in coding the user-defined properties as Lustre expressions. Use cases are presented showing the applicability of the method.