Decentralized control of cooperative systems captures the operation of a group of decision-makers that share a single global objective. The difficulty in solving optimally such problems arises when the agents lack full observability of the global state of the system when they operate. The general problem has been shown to be NEXP-complete. In this paper, we identify classes of decentralized con...

We address the solution of convex constrained nonlinear systems by new linesearch Quasi-Newton methods. These methods are based on a proper use of the projection map onto the constraint set and on a derivativefree and nonmonotone linesearch strategy. The convergence properties of the proposed methods are presented along with a worst-case iteration complexity bound. Several implementations of th...

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and computing its evaluation vector requires a worst-case complexity of O(n2n) integer operations. This way, with a different approach, we reach the same complex...

This study presents a full-duplex Radio-over-Fiber (RoF) system providing the users' wireless access with a bit rate of 10 Gbps over 40 GHz radio carrier. This system can be used in a centralized radio access network (C-RAN) architecture because we provide a fully analog front haul link between central station and base station. We can consider it as infrastructure between remote radio heads (RR...

Measurement-based timing analysis (MBTA) is often used to determine the timing behaviour of software programs embedded in safety-aware real-time systems deployed in various industrial domains including automotive and railway. MBTA methods rely on some form of instrumentation, either at hardware or software level, of the target program or fragments thereof to collect execution-time measurement d...

Programs that interact with the file system are a classical challenge to the testable software. Using directly file system primitives such as the System.IO.File class makes the code less testable since it hardcodes a dependency on the state of the physical file system at the time tests are executed. A classic symptomatic example are test case that pass the first time they are run, then fail on ...

Utility system operators and engineers want a better understanding of the impacts of large wind farms on grid stability before they are interconnected to the grid. Utilities need wind electrical models and methods of analysis that will help them analyze potential problems of grid stability. Without the necessary tools and knowledge of the behavior of large wind farms, utilities are reluctant to...

To reduce complexity while computing an upper bound on the worst-case execution time, static WCET analysis performs over-approximations. This feeds the general feeling that static WCET estimations can be far above the real WCET. This feeling is strengthened when these estimations are compared to measured execution times: generally, it is very unlikely to capture the worstcase from observations,...

Various tasks in decision making and decision support systems require selecting a preferred subset of a given set of items. Here we focus on problems where the individual items are described using a set of characterizing attributes, and a generic preference specification is required, that is, a specification that can work with an arbitrary set of items. For example, preferences over the content...

We present an approach for Worst-Case Execution Time (WCET) Analysis of embedded system software, that is generated from Petri net specifications. The presented approach is part of our work towards a Petri net based methodology for the seamless design of embedded real-time systems. One main characteristic of the approach is that standard Petri net analysis methods are utilized during timing ana...