no code implementations • 3 Dec 2019 • Nicolas Beldiceanu, Mats Carlsson, Claude-Guy Quimper, Maria-Isabel Restrepo-Ruiz
Given, a sequence $\mathcal{X}$ of $n$ variables, a time-series constraint ctr using the Sum aggregator, and a sliding time-series constraint enforcing the constraint ctr on each sliding window of $\mathcal{X}$ of $m$ consecutive variables, we describe a $\Theta(n)$ time complexity checker, as well as a $\Theta(n)$ space complexity reformulation for such sliding constraint.
no code implementations • 12 Feb 2019 • Morten Mossige, Arnaud Gotlieb, Helge Spieker, Hein Meling, Mats Carlsson
When testing industrial robots, it is common that the target machines need to share some common resources, e. g., costly hardware devices, and so there is a need to schedule test case execution on the target machines, accounting for these shared resources.
no code implementations • 26 Sep 2016 • Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson, Helmut Simonis
First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme.