Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Léo Exibard"'
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
Autor:
Luca Aceto, Antonis Achilleos, Duncan Paul Attard, Léo Exibard, Adrian Francalanza, Anna Ingólfsdóttir
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031081453
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35f2ceda2c69edba021f17c088d97aaf
https://doi.org/10.1007/978-3-031-08143-9_12
https://doi.org/10.1007/978-3-031-08143-9_12
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031081453
Coordination Models and Languages 24th IFIP WG 6.1 International Conference, COORDINATION 2022
17th International Federated Conference on Distributed Computing Techniques, DisCoTec 2022
17th International Federated Conference on Distributed Computing Techniques, DisCoTec 2022, Jun 2022, Lucca, Italy. pp.181-199, ⟨10.1007/978-3-031-08143-9_11⟩
Coordination Models and Languages 24th IFIP WG 6.1 International Conference, COORDINATION 2022
17th International Federated Conference on Distributed Computing Techniques, DisCoTec 2022
17th International Federated Conference on Distributed Computing Techniques, DisCoTec 2022, Jun 2022, Lucca, Italy. pp.181-199, ⟨10.1007/978-3-031-08143-9_11⟩
International audience; Monitorability is a characteristic that delineates between the properties that can be runtime verified by a monitor and those that cannot. Existing notions of monitorability for branching-time specifications are quite restrict
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c30c09b5c9d44b184b45354acf2819e
https://doi.org/10.1007/978-3-031-08143-9_11
https://doi.org/10.1007/978-3-031-08143-9_11
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d69026cc7a22238f89206ccc6ed208a
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
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
Publikováno v:
Developments in Language Theory-21st International Conference (DLT 2017)
Developments in Language Theory-21st International Conference (DLT 2017), Aug 2017, Liège, Belgium. pp.147-159
Charlier, Emilie, Leroy, Julien& Rigo, Michel (Eds.), Lecture Notes in Computer Science. Springer
Developments in Language Theory ISBN: 9783319628080
Developments in Language Theory-21st International Conference (DLT 2017), Aug 2017, Liège, Belgium. pp.147-159
Charlier, Emilie, Leroy, Julien& Rigo, Michel (Eds.), Lecture Notes in Computer Science. Springer
Developments in Language Theory ISBN: 9783319628080
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6aa1df1c9de8716393d01a1019b6448a
https://hal.archives-ouvertes.fr/hal-02112626/document
https://hal.archives-ouvertes.fr/hal-02112626/document