Publication

From Uncertainty Data to Robust Policies for Temporal Logic Planning

Related publications (61)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Matching techniques ride to rescue OLED displays

Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addressing time and thereby also the amplitude of the electrical current through ...

Springer2009

Mixed-Logic Dynamical System Modeling of Sigma Delta-Modulators and its Application to Stability Analysis

Jens Anders

In this paper, a novel model for single-bit internal quantizer Sigma Delta-modulators is presented. It is shown that this model can be used for an exact stability prediction of these systems. Furthermore, it is explained how the necessary computations can ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Declarative Specification and Alignment Verification of Services in ITIL

Gil Regev, Alain Wegmann, Irina Rychkova

IT organizations that wish to implement the best practices recommended by the IT Infrastructure Library (ITIL) need to specify the level of service provided to their customers. The implemented service needs to comply with this specification. We propose a m ...

2008

Compositional verification for component-based systems and application

Joseph Sifakis

We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transfer. The method is based on the use of two kinds of invariants. Component inv ...

2008

Design and optimization of district energy systems

François Maréchal, Daniel Favrat, Céline Weber

District energy systems have the potential to decrease the CO2 emissions linked to energy services (heating, hot water, cooling and electricity), thanks to the implementation of large polygeneration energy conversion technologies, connected to a group of b ...

Elsevier2007

From Liveness to Promptness

Liveness temporal properties state that something

good'' eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bound on the

wait time'' for an eventually to be fulfilled. That is,

F\theta

...

2007

Mapping task-graphs on distributed ECU networks: Efficient algorithms for feasibility and optimality

Friedrich Eisenbrand, Gennady Shmonin

This mapping problem has to be solved in many application scenarios. In the automotive industry, for example, the implementation of car functions involves distributed task sets running on multiple electronic control units (ECU) with bus-based inter-task co ...

2006

Network formulations of mixed-integer programs

Friedrich Eisenbrand, Marco Di Summa

Network formulations of mixed-integer programs ...

2006

BDDs in a branch and cut framework

Friedrich Eisenbrand

Branch and cut is today's state-of-the-art method to solve 0/1-integer linear programs. Important for the success of this method is the generation of strong valid inequalities, which tighten the linear programming relaxation of 0/1-IPs and thus allow for e ...

2005

Detecting Malicious Code by Model Checking

Johannes Kinder

The ease of compiling malicious code from source code in higher programming languages has increased the volatility of malicious programs: The first appearance of a new worm in the wild is usually followed by modified versions in quick succession. As demons ...

Springer2005

From Liveness to Promptness

Liveness temporal properties state that something

good'' eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bound on the

wait time'' for an eventually to be fulfilled. That is,

F\theta

...

2007