Elicitation of requirements for safety critical aeroengine control systems is dependent on the capture of core design intent and the systematic derivation of requirements addressi...
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
Abstract— In this paper, we present a novel universal approach which consists in exploring statistics in the compressed frequency domain. This approach is motivated by two main c...
Johann Barbier, Eric Filiol, Kichenakoumar Mayoura
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...