Analyzing schedulability of Astral specifications using extended time automata

DOI10.1007/BFB0002885MaRDI QIDQ4537141zbMATH OpenFDO

Authors Kasper Brink, J. van Katwijk, R. F. Lutje Spelberg, W. J. Toetenel

Publication date 6 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002885

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• Analysis of scheduling behaviour using generic timed automata
• Timed automata with asynchronous processes: Schedulability and decidability
• Schedulability analysis of fixed-priority systems using timed automata
• Schedulability verification of embedded system AADL model based on timed automata
• scientific article; zbMATH DE number 2147037

Cited in

(1)

• Schedulability verification of embedded system AADL model based on timed automata

This page was built for publication: Analyzing schedulability of Astral specifications using extended time automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537141)