• Title of article

    The complexity of temporal logic over the reals

  • Author/Authors

    Reynolds، نويسنده , , M.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2010
  • Pages
    34
  • From page
    1063
  • To page
    1096
  • Abstract
    It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense time temporal logic.
  • Keywords
    Temporal logic
  • Journal title
    Annals of Pure and Applied Logic
  • Serial Year
    2010
  • Journal title
    Annals of Pure and Applied Logic
  • Record number

    1444458

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1444458