Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Nathanaël Fijalkow"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)
We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is given by the
Externí odkaz:
https://doaj.org/article/7c90eca6db384821a2921e6c012fca3b
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games. In the first part we develop the theory of universal graphs, with two goals: showing an e
Externí odkaz:
https://doaj.org/article/91f753cabdd94834a31e9668084fc113
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 4 (2021)
Bertrand et al. introduced a model of parameterised systems, where each agent is represented by a finite state system, and studied the following control problem: for any number of agents, does there exist a controller able to bring all agents to a ta
Externí odkaz:
https://doaj.org/article/2771810ea0184adba890991e33082337
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 2 (2020)
Given two labelled Markov decision processes (MDPs), the trace-refinement problem asks whether for all strategies of the first MDP there exists a strategy of the second MDP such that the induced labelled Markov chains are trace-equivalent. We show th
Externí odkaz:
https://doaj.org/article/a7f5bef716e4465caa700c7a6a8f9cef
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 54, Iss Proc. GandALF 2011, Pp 74-86 (2011)
Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open
Externí odkaz:
https://doaj.org/article/7411d9126bb24aacab15c2e9e22e9ca4
Publikováno v:
Logical Methods in Computer Science, Vol Volume 11, Issue 2 (2015)
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? This problem was proved undecidable recently; to overcome this,
Externí odkaz:
https://doaj.org/article/77ee34e9f4bd43dda71f97548642022c
Autor:
Nathanaël Fijalkow, Martin Zimmermann
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 2 (2014)
We consider two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize th
Externí odkaz:
https://doaj.org/article/5b37ba3294d247d4aa4df033e99fa9d7
Publikováno v:
Model Checking Software ISBN: 9783031321566
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebde6c07e8412a9ce8e8f240b1e797e2
https://doi.org/10.1007/978-3-031-32157-3_7
https://doi.org/10.1007/978-3-031-32157-3_7
Publikováno v:
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning.
Do agents know each others’ strategies? In multi-process software construction, each process has access to the processes already constructed; but in typical human-robot interactions, a human may not announce its strategy to the robot (indeed, the h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::620e650b0f3cfd1abb0630e8519b0a6a
https://doi.org/10.24963/kr.2022/14
https://doi.org/10.24963/kr.2022/14
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a29793e85dc009632be016f2eabbf743
https://doi.org/10.1145/3431860
https://doi.org/10.1145/3431860