Spotlight abstraction in model checking real-time task schedulability

DOI10.1007/978-3-030-84629-9_4zbMath1490.68135OpenAlexW3193861647MaRDI QIDQ832017

Madoda Nxumalo, Stefan Gruner, Nils Timm

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84629-9_4

zbMATH Keywords

queuestimed automatamodel checkingschedulabilitythree-valued abstraction

Mathematics Subject Classification ID

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

Uses Software

• IMITATOR
• TIMES

Cites Work

• Better abstractions for timed automata
• What's decidable about hybrid automata?
• A theory of timed automata
• Sensitivity analysis for fixed-priority real-time systems
• Model Checking Real-Time Systems
• Three-Valued Abstraction for Continuous-Time Markov Chains
• Lectures on Concurrency and Petri Nets
• Abstraction refinement algorithms for timed automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spotlight abstraction in model checking real-time task schedulability