Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Arnaud Carayol"'
Autor:
Arnaud Carayol, Matthew Hague
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 1-24 (2014)
We present a survey of the saturation method for model-checking pushdown systems.
Externí odkaz:
https://doaj.org/article/12dd2362b2864eba8d82a0d03a1b7f73
Autor:
Arnaud Carayol, Antoine Meyer
Publikováno v:
Logical Methods in Computer Science, Vol Volume 2, Issue 2 (2006)
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its language is the set of all words labelling a path from an initial vertex
Externí odkaz:
https://doaj.org/article/c1259469bcd14fa0bb368a38379f91b9
Autor:
Andrzej S. Murawski, Olivier Serre, Matthew Hague, Christopher H. Broadbent, C.-H. Luke Ong, Arnaud Carayol
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22 (3), pp.16:1-16:51
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22 (3), pp.16:1-16:51
This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main motivation for studying these games comes from the connections from colla
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22 (2), ⟨10.1145/3452917⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22 (2), ⟨10.1145/3452917⟩
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main problems: model-c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4a269da01f8b1bb91c95eafc655a758
http://arxiv.org/abs/2010.06366
http://arxiv.org/abs/2010.06366
Autor:
Olivier Serre, Arnaud Carayol
Publikováno v:
30th Annual IEEE Symposium on Logic in Computer Science (LiCS 2015)
30th Annual IEEE Symposium on Logic in Computer Science (LiCS 2015), 2015, Kyoto, Japan. pp.12, ⟨10.1109/LICS.2015.62⟩
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 21 (3), pp.21:1-21:39. ⟨10.1145/3377137⟩
LICS
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 21 (3), pp.1-39. ⟨10.1145/3377137⟩
30th Annual IEEE Symposium on Logic in Computer Science (LiCS 2015), 2015, Kyoto, Japan. pp.12, ⟨10.1109/LICS.2015.62⟩
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 21 (3), pp.21:1-21:39. ⟨10.1145/3377137⟩
LICS
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 21 (3), pp.1-39. ⟨10.1145/3377137⟩
International audience; We consider games with two antagonistic players — Éloïse (modelling a program) and Abélard (modelling a byzantine environment) — and a third, unpredictable and uncontrollable player, that we call Nature. Motivated by th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::563de3e61bf5cf1137f6f406ad22cd64
Autor:
Olivier Serre, Arnaud Carayol
Publikováno v:
Information and Computation
Information and Computation, Elsevier, 2017, 252, pp.221-242. ⟨10.1016/j.ic.2016.11.005⟩
Information and Computation, Elsevier, 2017, 252, pp.221-242. ⟨10.1016/j.ic.2016.11.005⟩
International audience; We study finite automata running over infinite binary trees. A run of such an automaton is usually said to be accepting if all its branches are accepting. In this article, we relax the notion of accepting run by allowing a cer
Autor:
Stefan Göller, Arnaud Carayol
Publikováno v:
Theory of Computing Systems
Theory of Computing Systems, Springer Verlag, 2019, 63 (5), pp.926-955. ⟨10.1007/s00224-019-09914-2⟩
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Mar 2017, Hannover, Germany. 19, pp.19:1-19:13, 〈10.4230/LIPIcs.STACS.2017.19〉
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Mar 2017, Hannover, Germany. pp.19:1-19:13, ⟨10.4230/LIPIcs.STACS.2017.19⟩
Theory of Computing Systems, Springer Verlag, 2019, 63 (5), pp.926-955. ⟨10.1007/s00224-019-09914-2⟩
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Mar 2017, Hannover, Germany. 19, pp.19:1-19:13, 〈10.4230/LIPIcs.STACS.2017.19〉
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Mar 2017, Hannover, Germany. pp.19:1-19:13, ⟨10.4230/LIPIcs.STACS.2017.19⟩
International audience; A pattern is encountered in a word if some infix of the word is the image of the pattern under some non-erasing morphism. A pattern p is unavoidable if, over every finite alphabet, every sufficiently long word encounters p. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::253be03072f78db7caa232de3056c518
https://hal.archives-ouvertes.fr/hal-02415882
https://hal.archives-ouvertes.fr/hal-02415882
Publikováno v:
Fundamenta Informaticae
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2018, 160 (4), pp.361-384. ⟨10.3233/FI-2018-1687⟩
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2018, 160 (4), pp.361-384. ⟨10.3233/FI-2018-1687⟩
International audience; We consider imperfect information stochastic games where we require the players to use pure (i.e. non randomised) strategies. We consider reachability, safety, Büchi and co-Büchi objectives, and investigate the existence of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78484bc1bc3c5fdd714b92b501dae702
https://hal.archives-ouvertes.fr/hal-01831546
https://hal.archives-ouvertes.fr/hal-01831546
Autor:
Arnaud Carayol, Cyril Nicaud
This book constitutes the refereed proceedings of the 22nd International Conference on Implementation and Application of Automata, CIAA 2017,held in Marne-la-Vallée, France, in June 2017. The 17 revised full papers presented were carefully reviewed
Autor:
Cyril Nicaud, Arnaud Carayol
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319601335
Implementation and Application of Automata
Implementation and Application of Automata
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df1257ff4906a2fa7eeeede30d2866c7
https://doi.org/10.1007/978-3-319-60134-2
https://doi.org/10.1007/978-3-319-60134-2