Publication

Robust Control Policies Given Formal Specifications in Uncertain Environments

Publications associées (37)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

From Uncertainty Data to Robust Policies for Temporal Logic Planning

Maryam Kamgarpour, Tony Alan Wood

We consider the problem of synthesizing robust disturbance feedback policies for systems performing complex tasks. We formulate the tasks as linear temporal logic specifications and encode them into an optimization framework via mixed-integer constraints. ...

ACM2018

The SaPPART COST Action: main outcomes and deliverables

Pierre-Yves Gilliéron

The deployment of autonomous vehicles is becoming a reality on the European road network and will significantly affect the future liability of different actors in the road and transport sectors. Liability is strongly linked with the trust that you can have ...

2017

Multirate sliding mode disturbance compensation for model predictive control

Colin Neil Jones

In this paper, a novel hierarchical multirate control scheme for nonlinear discrete-time systems is presented, consisting of a robust nonlinear model predictive controller (NMPC) and a multirate sliding mode disturbance compensator (MSMDC). The proposed MS ...

Wiley-Blackwell2015

Contracts for Real-Time, Safety Critical Systems

Chandrakana Nandi

Verifying real-time systems goes beyond the verification of functional properties: it also requires the checking of real-time properties. This makes traditional contract-frameworks partially inept for checking real-time programs. This is a major problem be ...

2014

Sound Compilation of Reals

Viktor Kuncak, Eva Darulova

Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, including finite numerical precision of implementations. We present a programming model where the user writes a program in a real-valued implementation and sp ...

ACM2014

Autonomous vehicles share information crossing an intersection

Denis Gillet, Laleh Makarem

Autonomous vehicles can react faster than humans, they have more accurate perception and do not get distracted, sleepy or intoxicated. Autonomous vehicles could also increase the capacity of our current roads by allowing cars to be driven more closely to e ...

2012

Efficient Model Checking of Fault-Tolerant Distributed Protocols

Johannes Kinder

To aid the formal verification of fault-tolerant distributed protocols, we propose an approach that significantly reduces the costs of their model checking. These protocols often specify atomic, process-local events that consume a set of messages, change t ...

IEEE2011

Model checking: Algorithmic verification and debugging

Joseph Sifakis

Turing Lecture from the winners of the 2007 ACM A.M. Turing Award.In 1981, Edmund M. Clarke and E. Allen Emerson, working in the USA, and Joseph Sifakis working independently in France, authored seminal papers that founded what has become the highly succes ...

2009

Formal semantics for refinement verification of entreprise models

Irina Rychkova

In this dissertation we investigate how Business/IT alignment in enterprise models can be enhanced by using a software engineering stepwise refinement paradigm. To have an IT system that supports an enterprise and meets the enterprise business needs, manag ...

EPFL2008

Supporting Loop Proofs in KeY by using BLAST

Mathias Krebs

In contrast to beta-testing, formal verification can guarantee correctness of a program against a specification. Two basic verification techniques are theorem proving and model checking. Both have strengths and weaknesses. Theorem proving is powerful, but ...

2006