Formal verification of timed synchronous dataflow graphs using lustre

DOI10.1016/J.JLAMP.2021.100678OpenAlexW3144821052MaRDI QIDQ2043814

Imed Eddine Bennour

Publication date: 3 August 2021

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2021.100678

zbMATH Keywords

formal verificationmodel checkinglustresynchronous dataflow graph model

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• SPIN
• NuSMV
• Uppaal
• LUSTRE
• Kind 2

Cites Work

• Unnamed Item
• Unnamed Item
• Self-timed scheduling analysis for real-time applications
• A theory of timed automata
• Uppaal in a nutshell
• Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
• Static Optimal Scheduling for Synchronous Data Flow Graphs with Model Checking

This page was built for publication: Formal verification of timed synchronous dataflow graphs using lustre