Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Rubin, Sasha"'
We introduce LTLf+ and PPLTL+, two logics to express properties of infinite traces, that are based on the linear-time temporal logics LTLf and PPLTL on finite traces. LTLf+/PPLTL+ use levels of Manna and Pnueli's LTL safety-progress hierarchy, and th
Externí odkaz:
http://arxiv.org/abs/2411.09366
DAG-based consensus protocols are being adoption by blockchain companies to decrease energy footprints and improve security. A DAG-based consensus protocol collaboratively constructs a partial order of blocks of transactions and produces linearly ord
Externí odkaz:
http://arxiv.org/abs/2407.02167
We study the complexity of the model-checking problem for parameterized discrete-timed systems with arbitrarily many anonymous and identical processes, with and without a distinguished "controller", and communicating via synchronous rendezvous. Our f
Externí odkaz:
http://arxiv.org/abs/2310.02466
Autor:
Aminof, Benjamin, De Giacomo, Giuseppe, Di Stasio, Antonio, Francon, Hugo, Rubin, Sasha, Zhu, Shufang
In this paper, we study LTLf synthesis under environment specifications for arbitrary reachability and safety properties. We consider both kinds of properties for both agent tasks and environment specifications, providing a complete landscape of synt
Externí odkaz:
http://arxiv.org/abs/2308.15184
Autor:
Gorji, Niku, Rubin, Sasha
Recent work has unveiled a theory for reasoning about the decisions made by binary classifiers: a classifier describes a Boolean function, and the reasons behind an instance being classified as positive are the prime-implicants of the function that a
Externí odkaz:
http://arxiv.org/abs/2105.06001
Publikováno v:
EPTCS 326, 2020, pp. 114-130
We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a B\"uchi-style winning condition requiring to produce infinitely many play prefixes that satisfy a given regular specificat
Externí odkaz:
http://arxiv.org/abs/2009.11638
We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a B\"uchi-style winning condition requiring to produce infinitely many play prefixes that satisfy a given regular specificat
Externí odkaz:
http://arxiv.org/abs/2008.11562
Autor:
Gutierrez, Julian, Murano, Aniello, Perelli, Giuseppe, Rubin, Sasha, Steeples, Thomas, Wooldridge, Michael
The overall aim of our research is to develop techniques to reason about the equilibrium properties of multi-agent systems. We model multi-agent systems as concurrent games, in which each player is a process that is assumed to act independently and s
Externí odkaz:
http://arxiv.org/abs/2008.05643
We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player games with imperfect information, this problem is undecidable; but we
Externí odkaz:
http://arxiv.org/abs/2003.04730
Autor:
Berthon, Raphaël, Fijalkow, Nathanaël, Filiot, Emmanuel, Guha, Shibashis, Maubert, Bastien, Murano, Aniello, Pinault, Laureline, Pinchinat, Sophie, Rubin, Sasha, Serre, Olivier
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:
http://arxiv.org/abs/2002.03664