16 citations · 24 across the 6 of their papers we have counts for
6 papers
Interval Predictability in Discrete Event Systems
Alban Grastien
In this paper we study the problem of predictability in partially observable discrete event systems, i.e., the question whether an observer can predict the occurrence of a fault. W…
The Complexity of Switching and FACTS Maximum-Potential-Flow Problems
Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck
This papers considers the problem of maximizing the load that can be served by a power network. We use the commonly accepted Linear DC power network model and consider wo configura…
The Complexity of DC-Switching Problems
Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck
This report provides a comprehensive complexity study of line switching in the Linear DC model for the feasibility problem and the optimization problems of maximizing the load that…
AC-Feasibility on Tree Networks is NP-Hard
Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck
Recent years have witnessed significant interest in convex relaxations of the power flows, several papers showing that the second-order cone relaxation is tight for tree networks u…
Predictability of Event Occurrences in Timed Systems
Franck Cassez, Alban Grastien
We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of…
An example illustrating the imprecision of the efficient approach for diagnosis of Petri nets via integer linear programming
Alban Grastien
This document demonstrates that the efficient approach for diagnosis of Petri nets via integer linear programming may be unable to detect a fault even if the system is diagnosable.