Showing papers by "Jean-François Raskin published in 2009"
23 Jun 2009
TL;DR: This paper shows how to reduce the LTL realizability problem to a game with an observer that checks that the game visits a bounded number of times accepting states of a universal co-Buchi word automaton and shows that this observer can be made deterministic.
Abstract: In this paper, we study the structure of underlying automata based constructions for solving the LTL realizability and synthesis problem. We show how to reduce the LTL realizability problem to a game with an observer that checks that the game visits a bounded number of times accepting states of a universal co-Buchi word automaton. We show that such an observer can be made deterministic and that this deterministic observer has a nice structure which can be exploited by an incremental algorithm that manipulates antichains of game positions. We have implemented this new algorithm and our first results are very encouraging.
119 citations
30 Apr 2009
TL;DR: This case study shows that the tools for the automatic synthesis of robust and near-optimal controllers have reached a level of maturity that allows them to tackle interesting and relevant industrial control problems.
Abstract: In this paper, we show how to apply recent tools for the automatic synthesis of robust and near-optimal controllers for a real industrial case study. We show how to use three different classes of models and their supporting existing tools, Uppaal-TiGA for synthesis, phaver for verification, and Simulink for simulation, in a complementary way. We believe that this case study shows that our tools have reached a level of maturity that allows us to tackle interesting and relevant industrial control problems.
74 citations
03 Sep 2009
TL;DR: In this paper, the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics has been studied, and it has been shown that the problem is undecidable for ECL (Event Clock Logic), and therefore also for MITL.
Abstract: We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metric Interval Temporal Logic), a logic for which the satisfiability and validity problems are decidable, a necessary condition for the realizability problem to be decidable. On the positive side, we show that the realizability of LTL extended with past real-time formulas is decidable in 2EXPTIME, with a matching lower bound. On the negative side, we show that a simple extension of this decidable fragment with future real-time formulas leads to undecidability. In particular, our results imply that the realizability problem is undecidable for ECL (Event Clock Logic), and therefore also for MITL.
23 citations
TL;DR: Dans cet article, nous survolons plusieurs de ces travaux classiques ou recen ts: l’algorithme de Karp et Miller et un algorithme efficace en pratique, qui resolvent le probl eme de couverture en calculant un ensemble de couverts du reseau.
Abstract: ropres a representer les comportements de systemes informatiquesconcurrents. Dans ce cadre, leprobleme de couverture (etant donne un marquagem, existe-t-il un marquage accessible qui assigne a chaque place du reseau au moins autant de jetons quem ?) est de tout premier interet, car de nombreuses proprietes de surete (toutes les executions du systeme restent-elles dans un ens emble de bons etats ?) peuvent y etre ramenees. De nombreux travaux ont recemmen t ete consacres a l’etude d’algorithmes efficaces pour resoudre le probleme de couverture. Dans cet article, nous survolons plusieurs de ces travaux classiques ou recen ts: l’algorithme de Karp et Miller et un algorithme efficace en pratique, qui resolvent le probl eme de couverture en calculant un ensemble de couverture du reseau; l’approche « en arriere » d’Abdulla et al.; et l’approche « en avant » Expand, Enlarge and Check. Finalement, nous term inons l’article en presentant une nouvelle approche combinant les forces des methodes « en avant » et « en arriere ».
5 citations
07 Jul 2009
TL;DR: Two new algorithms for checking emptiness of alternating automata are developed and evaluated, which rely on antichains to efficiently manipulate the state-spaces underlying the analysis of alternating Automata.
Abstract: In this paper, we develop and evaluate two new algorithms for checking emptiness of alternating automata. These algorithms build on previous works. First, they rely on antichains to efficiently manipulate the state-spaces underlying the analysis of alternating automata. Second, they are abstract algorithms with built-in refinement operators based on techniques that exploit information computed by abstract fixed points (and not counter-examples as it is usually the case). The efficiency of our new algorithms is illustrated by experimental results.
4 citations