Formal verification of timed synchronous dataflow graphs using Lustre

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 m...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 121; p. 100678
Main Author Bennour, Imed Eddine
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.06.2021
Subjects
Formal verification
Lustre
Model checking
Synchronous dataflow graph model
Model checking
Lustre
Synchronous dataflow graph model
Formal verification
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2021.100678