From the Specification to the Scheduling of Time-Dependent Systems

DOI10.1007/3-540-45739-9_10MaRDI QIDQ5392287zbMATH OpenOpenAlexFDO

Authors Christophe Lohr, Jean-Pierre Courtiat

Publication date 8 April 2011

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

Full work available at URL https://doi.org/10.1007/3-540-45739-9_10

zbMATH Keywords

minimal reachability graphprocess algebraRT-Lotostemporal consistencytime labeled scheduling automatatimed automata

Mathematics Subject Classification ID

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

Recommendations

• Scheduling of time-triggered real-time systems
• scientific article; zbMATH DE number 177246
• scientific article; zbMATH DE number 177523
• Models and algorithms of time-dependent scheduling
• Scheduling with time dependent processing times: Review and extensions
• A concise survey of scheduling with time-dependent processing times
• scientific article; zbMATH DE number 4014024
• scientific article; zbMATH DE number 1497853
• Formalising scheduling theories in duration calculus

Cited in

(2)

• Synthesizing synchronous systems by static scheduling in space-time
• An automaton model for scheduling constraints in synchronous machines

This page was built for publication: From the Specification to the Scheduling of Time-Dependent Systems

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