Add to ORKGIn this paper, we investigate model checking algorithms for variants of strategy logic over pushdown multi-agent systems, modeled by pushdown game structures (PGSs). We consider various fragments of strategy logic, i.e., SL[CG], SL[DG], SL[1G] and BSIL. We show that the model checking problems on PGSs for SL[CG], SL[DG] and SL[1G] are 3EXTIME-complete, which are not harder than the problem for the subsumed logic ATL*. When BSIL is concerned, the model checking problem becomes 2EXPTIME-complete. Our algorithms are automata-theoretic and based on the saturation technique, which are amenable to implementations
Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an important paradigm ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In this paper, we investigate model checking algorithms for variants of strategy logic over pushdown...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an important paradigm ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an important paradigm ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an important paradigm ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In this paper, we investigate model checking algorithms for variants of strategy logic over pushdown...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an important paradigm ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an important paradigm ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an important paradigm ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...
In open systems verification, to formally check for reliability, one needs an appropriate formalism ...