Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
TEMPORAL LOGICS FOR GAMES Franois Laroussinie
 

Summary: TEMPORAL LOGICS FOR GAMES
François Laroussinie
LIAFA, Univ. Paris Diderot ­ Paris 7 & CNRS UMR 7089, IUF
Francois.Laroussinie@liafa.jussieu.fr
1 Introduction
Model-checking is now a well-established method in the area of formal verifica-
tion. It has been initiated roughly 25 years ago with the seminal papers by Pnueli,
Clarke and Sifakis [25, 13, 26], and since then many theoretical and practical
results have been obtained. In this framework, the behavior of the system to be
analyzed is described with some formal model, the property to be verified is stated
with a specification language and the analysis is done automatically with a tool (a
model checker).
One can use many different types of formalism to represent the behavior of a
system. This choice depends on the nature and the features of the system we deal
with: Which kind of data is manipulated by the system ? Is it necessary to handle
real-time constraints ? Are there probabilities to consider ? The same holds for
the specification language: for example, there is a wide family of temporal logics
allowing to express different kinds of properties. Of course there is a trade-off
between expressiveness and efficiency: at the very end, one aims at using a model-
checker to decide whether the specification is satisfied by the model and then the

  

Source: Aceto, Luca - School of Computer Science, Reykjavík University

 

Collections: Mathematics; Computer Technologies and Information Sciences