Toward Verifying Cooperatively Scheduled Runtimes Using CSP.
Jan Bækgaard PedersenKevin ChalmersPublished in: Formal Aspects Comput. (2023)
Keyphrases
- constraint satisfaction problems
- cooperative
- scheduling problem
- constraint satisfaction
- tree decomposition
- decomposition methods
- branch and bound
- arc consistency
- constraint solving
- constraint propagation
- constraint networks
- model checking
- constraint programming
- constraint graph
- search space
- arc consistency algorithm
- np hard
- tree decompositions
- verification method
- constraint problems
- arrival times
- real time
- decomposition method
- soft constraints
- non binary
- phase transition
- multi agent
- case study
- data sets