Results 1  10
of
110
Reasoning about Strategies: From module checking to strategy logic 3 / 33
, 2013
"... Game Theory is a fruitful metaphor in the verification and synthesis of multiagent systems, where agent behaviors are modeled by strategies in a game. Plenty of modal logics for the specification of strategic reasonings have been introduced, but with a very limited power and no unifying framework. ..."
Abstract
 Add to MetaCart
. Our aim Looking for a powerful logic in which one can talk explicitly about the strategic behavior of agents in generic multiplayer concurrent games. Aniello Murano Università degli Studi di Napoli "Federico II" Reasoning about Strategies: From module checking to strategy logic 2 / 33
c © Bianco, Faella, Mogavero, and Murano Quantitative Fairness Games∗
"... We consider twoplayer games played on finite colored graphs where the goal is the construction of an infinite path with one of the following frequencyrelated properties: (i) all colors occur with the same asymptotic frequency, (ii) there is a constant that bounds the difference between the occurr ..."
Abstract
 Add to MetaCart
We consider twoplayer games played on finite colored graphs where the goal is the construction of an infinite path with one of the following frequencyrelated properties: (i) all colors occur with the same asymptotic frequency, (ii) there is a constant that bounds the difference between the occurrences of any two colors for all prefixes of the path, or (iii) all colors occur with a fixed asymptotic frequency. These properties can be viewed as quantitative refinements of the classical notion of fair path in a concurrent system, whose simplest form checks whether all colors occur infinitely often. In particular, the first two properties enforce equal treatment of all the jobs involved in the system, while the third one represents a way to assign a given priority to each job. For all the above goals, we show that the problem of checking whether there exists a winning strategy is CoNPcomplete. 1
Strategy Logic Fragments
"... Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a formalism for reasoning explicitly about strategies, as firstorder objects, in multiagent concurrent games [3]. This logic turns to be very powerful, strictly subsuming all major previously studied moda ..."
Abstract
 Add to MetaCart
Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a formalism for reasoning explicitly about strategies, as firstorder objects, in multiagent concurrent games [3]. This logic turns to be very powerful, strictly subsuming all major previously studied
What Makes ATL ∗ Decidable? A Decidable Fragment of Strategy Logic
"... Abstract Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a formalism for reasoning explicitly about strategies, as firstorder objects, in multiagent concurrent games. This logic turns out to be very powerful, strictly subsuming all major previously stu ..."
Abstract

Cited by 18 (11 self)
 Add to MetaCart
Abstract Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a formalism for reasoning explicitly about strategies, as firstorder objects, in multiagent concurrent games. This logic turns out to be very powerful, strictly subsuming all major previously
Reasoning About Strategies
 In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science’10, LIPIcs 8
, 2010
"... In open systems verification, to formally check for reliability, one needs an appropriate formalism to model the interaction between open entities and express that the system is correct no matter how the environment behaves. An important contribution in this context is given by modal logics for stra ..."
Abstract

Cited by 41 (19 self)
 Add to MetaCart
In open systems verification, to formally check for reliability, one needs an appropriate formalism to model the interaction between open entities and express that the system is correct no matter how the environment behaves. An important contribution in this context is given by modal logics for strategic ability, in the setting of multiagent games, such as ATL, ATL*, and the like. Recently, Chatterjee, Henzinger, and Piterman introduced Strategy Logic, which we denote here by SLCHP, with the aim of getting a powerful framework for reasoning explicitly about strategies. SLCHP is obtained by using firstorder quantifications over strategies and it has been investigated in the specific setting of twoagents turnedbased game structures where a nonelementary modelchecking algorithm has been provided. While SLCHP is a very expressive logic, we claim that it does not fully capture the strategic aspects of multiagent systems. In this paper, we introduce and study a more general strategy logic, denoted SL, for reasoning about strategies in multiagent concurrent systems. We prove that SL strictly includes SLCHP, while maintaining a decidable modelchecking problem. Indeed, we show that it is 2EXPTIMECOMPLETE, thus not harder than that for ATL * and a remarkable improvement of the same problem for SLCHP. We also consider the satisfiability problem and show that it is undecidable already for the sublogic SLCHP under the concurrent game semantics. Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2010.133 1
On the Boundary of Behavioral Strategies
"... Abstract—In the setting of multiagent games, considerable effort has been devoted to the definition of modal logics for strategic reasoning. In this area, a recent contribution is given by the introduction of Strategy Logic (SL, for short) by Mogavero, Murano, and Vardi. This logic allows to reason ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
Abstract—In the setting of multiagent games, considerable effort has been devoted to the definition of modal logics for strategic reasoning. In this area, a recent contribution is given by the introduction of Strategy Logic (SL, for short) by Mogavero, Murano, and Vardi. This logic allows
3 4 5 6
"... Abstract—Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as firstorder objects, in multiagent concurrent games. This logic turns to be very powerful, subsuming all major previously studied mo ..."
Abstract
 Add to MetaCart
Abstract—Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as firstorder objects, in multiagent concurrent games. This logic turns to be very powerful, subsuming all major previously studied
Pushdown Module Checking for BranchingTime Temporal Logics
"... In system modeling, a main distinction is between closed systems, whose behavior is totally determined by the program, and open systems, which are systems where the program interacts with an external environment [HP85, Hoa85]. In order to check whether a closed system satisfies a required property, ..."
Abstract
 Add to MetaCart
In system modeling, a main distinction is between closed systems, whose behavior is totally determined by the program, and open systems, which are systems where the program interacts with an external environment [HP85, Hoa85]. In order to check whether a closed system satisfies a required property, we translate the system into a formal model (such as a transition system), specify the property with a temporallogic formula (such as CTL [CE81], CTL ∗ [EH86], and µcalculus [Koz83]), and check formally that the model satisfies the formula. This process is called model checking ([CE81, QS81]). Checking whether an open system satisfies a required temporal logic formula is much harder, as one has to consider the interaction of the system with all possible environments. We consider open systems that are modeled in the framework introduced by Kupferman, Vardi, and Wolper. Concretely, in [KV96, KVW01], an open finitestate system is described by an extended transition system called a module, whose set of states is partitioned into system states (where the system makes a transition) and environment states (where the environment makes a transition). Given a module M describing the system to be verified and a temporal logic formula ϕ specifying the desired behavior of the system, the problem of model checking a module, called module checking,
Slide Test Maker An Educational Software Tool for Test Composition
"... Abstract. In every day life education, tests play a key role. They represent a standard vehicle for assessing proficiency, measuring aptitude or determining skill and knowledge in any teaching field. In this paper, we present Slide Test Maker (STM), a software tool based on Java, whose main objectiv ..."
Abstract
 Add to MetaCart
Abstract. In every day life education, tests play a key role. They represent a standard vehicle for assessing proficiency, measuring aptitude or determining skill and knowledge in any teaching field. In this paper, we present Slide Test Maker (STM), a software tool based on Java, whose main objective is to help teachers in a quick composition of online tests. Starting from a generic lesson in slideshow format, STM allows the user to easily tag the contents (texts, sounds, images, video, etc.) in the presentation, in order to construct the test, in a very easy and intuitive way. The composed test can then be saved and exported in PDF format and as a Learning Object in a standard format. 1
The Pushdown Module Checking Saga
"... A main distinction in system modeling is between closed systems, whose behavior is totally determined by the program, and open systems, which are systems where the program interacts with an external environment [HP85, Hoa85]. In order to check whether a closed system satisfies a required property, w ..."
Abstract
 Add to MetaCart
A main distinction in system modeling is between closed systems, whose behavior is totally determined by the program, and open systems, which are systems where the program interacts with an external environment [HP85, Hoa85]. In order to check whether a closed system satisfies a required property, we translate the system into a formal model (such as a transition system), specify the property with a temporallogic formula (such as CTL [CE81], CTL ∗ [EH86], and µcalculus [Koz83]), and check formally that the model satisfies the formula. This process is called model checking ([CE81, QS81]). Checking whether an open system satisfies a required temporal logic formula is much harder, as one has to consider the interaction of the system with all possible environments. In this paper, we consider open systems which are modeled in the framework introduced by Kupferman, Vardi, and Wolper. Concretely, in [KV96, KVW01], an open finitestate system is described by an extended transition system called a module, whose set of states is partitioned into system states (where the system makes a transition) and environment states (where the environment makes a
Results 1  10
of
110