Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Emmanuel Filiot"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can produce th
Externí odkaz:
https://doaj.org/article/dc790dc067d24f6e9af81ba90ee9e831
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
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 4 (2019)
Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free automata,
Externí odkaz:
https://doaj.org/article/1573398d39d44825b01607fc37bf4daf
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 2 (2019)
We consider the problem of evaluating in streaming (i.e., in a single left-to-right pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that
Externí odkaz:
https://doaj.org/article/cb9a45171c924ea4981837832a8e555a
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 146, Iss Proc. SR 2014, Pp 1-8 (2014)
When reasoning about the strategic capabilities of an agent, it is important to consider the nature of its adversaries. In the particular context of controller synthesis for quantitative specifications, the usual problem is to devise a strategy for a
Externí odkaz:
https://doaj.org/article/532a33e24a904a4e91e8c5dfdc081016
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
Publikováno v:
Logical Methods in Computer Science, Vol Volume 11, Issue 3 (2015)
A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along e
Externí odkaz:
https://doaj.org/article/c3477a836cd743e49042e9c569d5c10d
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783031308192
We study a variant of the problem of synthesizing Mealy machines that enforce LTL specifications against all possible behaviours of the environment, including hostile ones. In the variant studied here, the user provides the high level LTL specificati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::746e8a2790c23e77d9de1d6f48e49c43
https://doi.org/10.1007/978-3-031-30820-8_20
https://doi.org/10.1007/978-3-031-30820-8_20
Autor:
Sasha Rubin, Emmanuel Filiot, Aniello Murano, Sophie Pinchinat, Olivier Serre, Shibashis Guha, Bastien Maubert, Nathanaël Fijalkow, Laureline Pinault, Raphaël Berthon
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, 2021, 22 (1), pp.1-24. ⟨10.1145/3431860⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 22 (1), ⟨10.1007/s00037-021-00214-1⟩
ACM Transactions on Computational Logic, 2020, 22 (1), ⟨10.1145/3431860⟩
ACM Transactions on Computational Logic, 2021, 22 (1), pp.1-24. ⟨10.1145/3431860⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 22 (1), ⟨10.1007/s00037-021-00214-1⟩
ACM Transactions on Computational Logic, 2020, 22 (1), ⟨10.1145/3431860⟩
We study alternating automata with qualitative semantics over infinite binary trees: Alternation means that two opposing players construct a decoration of the input tree called a run, and the qualitative semantics says that a run of the automaton is
Publikováno v:
Journal of computer and system sciences, 106
In this paper, we investigate the expressive power and the algorithmic properties of weighted expressions, which define functions from finite words to integers. First, we consider a slight extension of an expression formalism, introduced by Chatterje