Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Logical and Algebraic Methods in Programming
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
