A Generalized Digraph Model for Expressing Dependencies
Pascal Fradet, Xiaojie Guo, Jean‐François Monin, Sophie Quinton · 2018
In the context of computer assisted verification of schedulability analyses, very expressive task models are useful to factorize the correctness proofs of as many analyses as possible. The digraph task model seems a good candidate due to its powerful expressivity. Alas, its ability to capture dependencies between arrival and execution times of jobs of different tasks is very limited.