• DocumentCode
    2195514
  • Title

    Temporal logic with forgettable past

  • Author

    Laroussinie, François ; Markey, Nicolas ; Schnoebelen, Philippe

  • Author_Institution
    Lab. Specification et Verification, ENS de Cachan, France
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    383
  • Lastpage
    392
  • Abstract
    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.
  • Keywords
    automata theory; computability; computational complexity; temporal logic; EXPSPACE-complete problems; NLTL; forgettable past; linear-time temporal logic; model checking; optimal automata-theoretic algorithms; satisfiability; Automatic logic units; Computer science; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 2002. Proceedings. 17th Annual IEEE Symposium on
  • ISSN
    1043-6871
  • Print_ISBN
    0-7695-1483-9
  • Type

    conf

  • DOI
    10.1109/LICS.2002.1029846
  • Filename
    1029846
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2195514