Schedulability analysis of fixed-priority systems using timed automata

DOI10.1016/j.tcs.2005.11.019zbMath1088.68087OpenAlexW2127200569MaRDI QIDQ2368958

Wang Yi, Leonid Mokrushin, Elena Fersman, Paul Pettersson

Publication date: 28 April 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.019

zbMATH Keywords

Timed automataSchedulability analysisReal time systemsModelling and verification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

Model Checking Real-Time Systems ⋮ Formal verification of real-time systems with preemptive scheduling ⋮ Task automata: Schedulability, decidability and undecidability ⋮ A study on shuffle, stopwatches and independently evolving clocks ⋮ Temporal Robustness of Stochastic Signals ⋮ On Scheduling Policies for Streams of Structured Jobs ⋮ Graph-based models for real-time workload: a survey ⋮ MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS ⋮ Static Optimal Scheduling for Synchronous Data Flow Graphs with Model Checking ⋮ Investigating the usability of real-time scheduling theory with the Cheddar project

Uses Software

• TIMES
• Uppaal

Cites Work

• The algorithmic analysis of hybrid systems
• Scheduler modeling based on the controller synthesis paradigm
• A theory of timed automata
• Verification, refinement and scheduling of real-time programs
• Uppaal in a nutshell
• Tools and Algorithms for the Construction and Analysis of Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Schedulability analysis of fixed-priority systems using timed automata