• Publications
  • Influence
An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system
TLDR
This paper addresses a pre-runtime multiprocessor scheduling problem for an avionic system with periodic tasks, where each task is beforehand assigned to a processor. Expand
  • 13
  • 2
  • PDF
Computational complexity of linear constraints over the integers
TLDR
We study the computational complexity of continuous-time temporal constraint reasoning under the assumption that time is discrete instead of continuous. Expand
  • 16
  • PDF
Limitations of acyclic causal graphs for planning
TLDR
We show that in the worst case, the problem of plan existence is PSPACE-complete even when the causal graph is acyclic. Expand
  • 3
  • PDF
Discrete-Time Temporal Reasoning with Horn DLRs
TLDR
We study the computational complexity of temporal constraint reasoning under the assumption that time is discrete instead of continuous. Expand
  • 1
  • PDF
When Acyclicity Is Not Enough: Limitations of the Causal Graph
TLDR
We study a subclass of planning instances with acyclic causal graphs whose variables have strongly connected domain transition graphs. Expand
  • 2
  • PDF
A constraint generation procedure for pre-runtime scheduling of integrated modular avionic systems
TLDR
In modern integrated modular avionic systems, applications share hardware resources on a common avionic platform. Expand