Static Optimal Scheduling for Synchronous Data Flow Graphs with Model Checking

DOI10.1007/978-3-319-19249-9_34zbMath1427.68177OpenAlexW635594912MaRDI QIDQ5206962

Xueyang Zhu, Wen-Hui Zhang, Jian Zhang, Yu-Lei Gu, Rongjie Yan, Guang-Quan Zhang

Publication date: 19 December 2019

Published in: FM 2015: Formal Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19249-9_34

zbMATH Keywords

timed automatathroughputenergy consumptionmulti-constraintdata flow graphsUPPAAL

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Formal verification of timed synchronous dataflow graphs using lustre

Cites Work

• A theory of timed automata
• NuSMV: A new symbolic model checker
• Uppaal in a nutshell
• Scheduling with timed automata
• Schedulability analysis of fixed-priority systems using timed automata
• Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
• Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
• Formal Methods for Components and Objects

This page was built for publication: Static Optimal Scheduling for Synchronous Data Flow Graphs with Model Checking