Finding Best and Worst Case Execution Times of Systems Using Difference-Bound Matrices

DOI10.1007/978-3-319-10512-3_4MaRDI QIDQ5500552zbMATH OpenOpenAlexFDO

Authors Omar Al-Bataineh, Mark Alexander Reynolds, Tim French

Publication date 6 August 2015

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

Full work available at URL https://doi.org/10.1007/978-3-319-10512-3_4

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Determination of exact upper estimates of time taken to perform complex sets of problems in control, parallel computing systems
• Bounding the execution time of software in realtime systems
• Linear approximation of execution-time constraints
• Determining best-case and worst-case times of unknown paths in time workflow nets

Cited in

(2)

• Finding minimum and maximum termination time of timed automata models with cyclic behaviour
• Accelerating worst case execution time analysis of timed automata models with cyclic behaviour

Describes a project that uses

Uses Software

• opaal

This page was built for publication: Finding Best and Worst Case Execution Times of Systems Using Difference-Bound Matrices

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