MPI-INF Logo
Campus Event Calendar

Event Entry

New for: D2, D3

What and Who

PhD Application Talk: Reactive Synthesis - From Realizability to Optimization

Peter Faymonville
Saarland University
Talk
AG 1, AG 3, AG 5, SWS, AG 2, AG 4, RG1, MMCI  
MPI Audience
English

Date, Time and Location

Monday, 12 July 2010
13:00
90 Minutes
E1 4
024
Saarbrücken

Abstract

The synthesis of finite-state machines given a temporal logic specification has been a long-running goal in computer science, first stated as a circuit problem by Alonzo Church in 1957. It has gained recent attention as newly developed or adapted techniques made the approach computationally more feasible. Its prime advantage is correctness-by-construction: the synthesized solution is a robust system satisfying the specification even in hostile environments.

The common statement of the problem asks for any solution to the problem. In practice, this can yield an unsuitable solution, in part due to missing expressivity of the specification logic. The liveness-operator 'eventually' can delay responses arbitrarily long - as long as there exists a path suffix delivering a response - without violating the specification.
Therefore I propose using a parametric version of temporal logic, adding expressivity to the specification logic. The parameters express upper bounds on the path operators, s.t. responses have to be delivered before the time bound. They form a realizability design space for the system, which is able to visualize the impact of additional requirements or components on the response guarantees for the system designer.
In this talk, I will give results on a fragment of this logic, showing decidability and algorithmic approaches to solve this problem in the context of reactive systems synthes.

Contact

IMPRS-C´S
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

Please note: The talks will take place in random order!

Heike Przybyl, 07/01/2010 15:56 -- Created document.