• DocumentCode
    728983
  • Title

    PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic

  • Author

    Carreiro, Facundo

  • fYear
    2015
  • fDate
    6-10 July 2015
  • Firstpage
    341
  • Lastpage
    352
  • Abstract
    We introduce a new class of parity automata which, on trees, captures the expressive power of weak chain logic. This logic is a variant of monadic second-order logic which quantifies over finite chains. Using this new tool, we show that the bisimulation-invariant fragment of weak chain logic is equivalent to propositional dynamic logic.
  • Keywords
    automata theory; bisimulation equivalence; trees (mathematics); PDL; bisimulation-invariant fragment; finite chains; monadic second-order logic; parity automata; propositional dynamic logic; trees; weak chain logic; Additives; Automata; Color; Context; Games; Semantics; Standards;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science (LICS), 2015 30th Annual ACM/IEEE Symposium on
  • Conference_Location
    Kyoto
  • ISSN
    1043-6871
  • Type

    conf

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