Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Alternatingtime Temporal Logic \Lambda Rajeev Alur y Thomas A. Henzinger z Orna Kupferman x
 

Summary: Alternating­time Temporal Logic \Lambda
Rajeev Alur y Thomas A. Henzinger z Orna Kupferman x
Abstract
Temporal logic comes in two varieties: linear­time
temporal logic assumes implicit universal quantifica­
tion over all paths that are generated by system moves;
branching­time temporal logic allows explicit existen­
tial and universal quantification over all paths. We
introduce a third, more general variety of temporal
logic: alternating­time temporal logic offers selective
quantification over those paths that are possible out­
comes of games, such as the game in which the system
and the environment alternate moves. While linear­
time and branching­time logics are natural specifi­
cation languages for closed systems, alternating­time
logics are natural specification languages for open sys­
tems. For example, by preceding the temporal oper­
ator ``eventually'' with a selective path quantifier, we
can specify that in the game between the system and
the environment, the system has a strategy to reach

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

 

Collections: Computer Technologies and Information Sciences