Optimal controller synthesis for timed systems

Autor: Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier

Publikováno v: Logical Methods in Computer Science, Vol Volume 19, Issue 1 (2023)

Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the cumulative weight while reaching a target. Used in a reactive synthesis perspective, this quantitative ex

Externí odkaz: https://doaj.org/article/f87dd068c7794c72bd2691d7343d7ad0

Synthesis of Data Word Transducers

Autor: Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier

Publikováno v: Logical Methods in Computer Science, Vol Volume 17, Issue 1 (2021)

In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifications are usually modelled as logical formulae or automata over infi

Externí odkaz: https://doaj.org/article/b8485681673e40079b2fc4ec4ecd713f

Expressiveness of Visibly Pushdown Transducers

Autor: Mathieu Caralp, Emmanuel Filiot, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot

Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 134, Iss Proc. TTATT 2013, Pp 17-26 (2013)

Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure. As trees and more generally hedges can be linearized

Externí odkaz: https://doaj.org/article/61ac24a267784ee49efa113b8a0673a7

Optimal controller synthesis for timed systems

Autor: Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier

Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the cumulative weight while reaching a target. Used in a reactive synthesis perspective, this quantitative ex

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::624f1a0e7a8103bef1eda3068058aa9f

On Computability of Data Word Functions Defined by Transducers

Autor: Léo Exibard, Pierre-Alain Reynier, Emmanuel Filiot

Publikováno v: Foundations of Software Science and Computation Structures-23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings
Foundations of Software Science and Computation Structures-23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Apr 2020, Dublin, Ireland. pp.217-236, ⟨10.1007/978-3-030-45231-5_12⟩
Lecture notes in computer science, 12077 LNCS
Lecture Notes in Computer Science ISBN: 9783030452308
FoSSaCS
Foundations of Software Science and Computation Structures

In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data ω-words). The notion of computability is defined through Turing machines with infinite inputs which can produce the corr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c67993277decbf7a5ff777866e812cbb