Results 1  10
of
397
Graded AlternatingTime Temporal Logic
, 2009
"... Abstract. Recently, graded modalities have been added to the semantics of two of the logics most commonly used by the computer science community: µcalculus, in [KSV02], and Ctl in [FNP08]. In both these settings, graded modalities enrich the universal and existential quantifiers with the capability ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
the Alternatingtime Temporal Logic (Atl), a derivative of Ctl that is interpreted on games, rather than transition systems. We present two different semantics: the first seems suitable to offline synthesis applications while the second may find application in the verification of faulttolerant controllers
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 620 (53 self)
 Add to MetaCart
variety of temporal logic: alternatingtime temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves. While lineartime and branchingtime logics are natural specification languages
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1388 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Alternatingtime temporal logics with irrevocable strategies
 In Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK’07
"... In Alternatingtime Temporal Logic (atl), one can express statements about the strategic ability of an agent (or a coalition of agents) to achieve a goal φ such as: “agent i can choose a strategy such that, if i follows this strategy then, no matter what other agents do, φ will always be true”. Howe ..."
Abstract

Cited by 39 (9 self)
 Add to MetaCart
In Alternatingtime Temporal Logic (atl), one can express statements about the strategic ability of an agent (or a coalition of agents) to achieve a goal φ such as: “agent i can choose a strategy such that, if i follows this strategy then, no matter what other agents do, φ will always be true
Complete axiomatization and decidability of alternatingtime temporal logic
 Theor. Comput. Sci
"... Alternatingtime Temporal Logic (ATL), introduced by Alur, Henzinger and Kupferman, is a logical formalism for the specification and verification of open systems involving multiple autonomous players (agents, components). In particular, this logic allows for the explicit expression of coalition abi ..."
Abstract

Cited by 38 (5 self)
 Add to MetaCart
Alternatingtime Temporal Logic (ATL), introduced by Alur, Henzinger and Kupferman, is a logical formalism for the specification and verification of open systems involving multiple autonomous players (agents, components). In particular, this logic allows for the explicit expression of coalition
Cooperation, Knowledge, and Time: Alternatingtime Temporal Epistemic Logic and its Applications
 Copyright 2004 ACM
, 2003
"... Branchingtime temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic ctl, which has made it possible to imp ..."
Abstract

Cited by 89 (8 self)
 Add to MetaCart
 Alternatingtime Temporal Epistemic Logic (atel)  shares the tractability of model checking with its atl parent, and is a succinct and expressive language for reasoning about gamelike multiagent systems.
Distributed synthesis for alternatingtime logics
 In Proceedings of the 5th International Symposium on Automated Technology for Verification and Analysis (ATVA 2007), LNCS 4762
, 2007
"... Abstract. We generalize the distributed synthesis problem to the setting of alternatingtime temporal logics. Alternatingtime logics specify the gamelike interaction between processes in a distributed system, which may cooperate on some objectives and compete on others. Our synthesis algorithm w ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We generalize the distributed synthesis problem to the setting of alternatingtime temporal logics. Alternatingtime logics specify the gamelike interaction between processes in a distributed system, which may cooperate on some objectives and compete on others. Our synthesis algorithm
Alternatingtime temporal logic with explicit strategies
 In TARK ’07: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
, 2007
"... We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences of path quantifiers, and, as a consequence, it possible to express in ATLES some properties that cannot be expressed even in ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences of path quantifiers, and, as a consequence, it possible to express in ATLES some properties that cannot be expressed even in ATL ∗. We present a complete axiomatic system for ATLES. Moreover, we show that satisfiability problem for ATLES is no more complex than for ATL: it is EXPTIMEcomplete. We identify two variants of the modelchecking problem for ATLES and investigate their computational complexity. Finally, we show how ATLES can be used to reason about extensive games. 1
Relentful Strategic Reasoning in AlternatingTime Temporal Logic
, 2012
"... Temporal logics are a well investigated formalism for the specification, verification, and synthesis of reactive systems. Within this family, AlternatingTime Temporal Logic (ATL ∗ , for short) has been introduced as a useful generalization of classical linear and branchingtime temporal logics, by ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
Temporal logics are a well investigated formalism for the specification, verification, and synthesis of reactive systems. Within this family, AlternatingTime Temporal Logic (ATL ∗ , for short) has been introduced as a useful generalization of classical linear and branchingtime temporal logics
Results 1  10
of
397