Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Aminof, Benjamin"'
We study the complexity of the model-checking problem for discrete-timed systems with arbitrarily many anonymous and identical contributors, with and without a distinguished "controller" process, communicating via synchronous rendezvous. Our work ext
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
We address two central notions of fairness in the literature of planning on nondeterministic fully observable domains. The first, which we call stochastic fairness, is classical, and assumes an environment which operates probabilistically using possi
Externí odkaz:
http://arxiv.org/abs/1912.11203
In Reasoning about Action and Planning, one synthesizes the agent plan by taking advantage of the assumption on how the environment works (that is, one exploits the environment's effects, its fairness, its trajectory constraints). In this paper we st
Externí odkaz:
http://arxiv.org/abs/1807.06777
Publikováno v:
In Artificial Intelligence July 2022 308
We consider the model checking problem of infinite state systems given in the form of parameterized discrete timed networks with multiple clocks. We show that this problem is decidable with respect to specifications given by B- or S-automata. Such sp
Externí odkaz:
http://arxiv.org/abs/1609.04176
Publikováno v:
EPTCS 218, 2016, pp. 1-14
Strategy Logic (SL) is a logical formalism for strategic reasoning in multi-agent systems. Its main feature is that it has variables for strategies that are associated to specific agents with a binding operator. We introduce Graded Strategy Logic (Gr
Externí odkaz:
http://arxiv.org/abs/1607.03354
Graded path modalities count the number of paths satisfying a property, and generalize the existential (E) and universal (A) path modalities of CTL*. The resulting logic is called GCTL*. We settle the complexity of satisfiability of GCTL*, i.e., 2Exp
Externí odkaz:
http://arxiv.org/abs/1410.7551
Autor:
Aminof, Benjamin, Rubin, Sasha
Publikováno v:
EPTCS 146, 2014, pp. 83-90
First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of the edges (o
Externí odkaz:
http://arxiv.org/abs/1404.0843
We revisit the parameterized model checking problem for token-passing systems and specifications in indexed $\textsf{CTL}^\ast \backslash \textsf{X}$. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed $\textsf{
Externí odkaz:
http://arxiv.org/abs/1311.4425