loading...
Temporal Logic with Forgettable Past
Copenhagen, Denmark July 22-July 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2002.102984617th Annual IEEE Symposium on Logic i ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
François Laroussinie, Nicolas Markey, Philippe Schnoebelen, "Temporal Logic with Forgettable Past," Logic in Computer Science, Symposium on, pp. 383, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2002.1029846,
author = {François Laroussinie and Nicolas Markey and Philippe Schnoebelen},
title = {Temporal Logic with Forgettable Past},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2002},
issn = {1043-6871},
pages = {383},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2002.1029846},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Temporal Logic with Forgettable Past
SN - 1043-6871
SP
EP
A1 - François Laroussinie,
A1 - Nicolas Markey,
A1 - Philippe Schnoebelen,
PY - 2002
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
François Laroussinie, ENS de Cachan & CNRS UMR
Nicolas Markey, ENS de Cachan & CNRS UMR and Université Orléans & CNRS
Philippe Schnoebelen, ENS de Cachan & CNRS UMR
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL +Past (which in turn can be more succinct than LTL). We study satisfiability and model checking for NLTL and provide optimal automata-theoretic algorithms for these EXPSPACE-complete problems.
Citation:
François Laroussinie, Nicolas Markey, Philippe Schnoebelen, "Temporal Logic with Forgettable Past," lics, pp.383, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.