Agent systems are distributed systems consist of agents that autonomously interact to each
other in an environment to perform tasks and achieve goals. Performing verification is …

We study a generalized form of planning under partial observability, in which we have
multiple, possibly infinitely many, planning domains with the same actions and observations …

In game theory, deciding whether a designed player wins a game corresponds to check
whether he has a winning strategy. There are situations in which it is important to know …

Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an
important paradigm of infinite-state multi-agent systems. Alternating-time temporal logics are …

In game theory, deciding whether a designed player wins a game amounts to check whether
he has a winning strategy. However, there are several game settings in which knowing …

In this paper, we investigate the module-checking problem of pushdown multi-agent systems
(PMS) against ATL and ATL* specifications. We establish that for ATL, module checking of …

Hierarchical state machines represent a natural and useful framework to model and reason
about modern systems. These machines encompass the ability to model hierarchical …

In this paper we introduce and study Event-Clock Nested Automata (ECNA), a formalism that
combines Event Clock Automata (ECA) and Visibly Pushdown Automata (VPA). ECNA allow …

Concurrent stochastic games are an important formalism for the rational verification of
probabilistic multi-agent systems, which involves verifying whether a temporal logic property …

In this paper, we investigate model checking algorithms for variants of strategy logic over
pushdown multi-agent systems, modeled by pushdown game structures (PGSs). We …