• DocumentCode
    2867336
  • Title

    Model Checking Branching Time Logics

  • Author

    Schnoebelen, Ph

  • Author_Institution
    CNRS, Cachan
  • fYear
    2007
  • fDate
    28-30 June 2007
  • Firstpage
    5
  • Lastpage
    5
  • Abstract
    Branching-time logics are temporal logics that allow quantification over possible futures. Such logics have been considered very early by the automated verification community because efficient model-checking algorithms for logics like CTL could be easily implemented and were used successfully.
  • Keywords
    computational complexity; formal verification; temporal logic; CTL; NP-complete problem; NP-hard problem; automated verification community; branching-time logic; model-checking algorithm; temporal logic; Automata; Automatic logic units; Automatic programming; Circuits; Computer science; Educational institutions; Logic programming; Polynomials; Power system modeling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Temporal Representation and Reasoning, 14th International Symposium on
  • Conference_Location
    Alicante
  • ISSN
    1530-1311
  • Print_ISBN
    978-0-7695-2836-6
  • Type

    conf

  • DOI
    10.1109/TIME.2007.52
  • Filename
    4438666
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2867336