Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Branching–Time Logics Repeatedly Referring to States

Volker Weber
Journal of Logic, Language, and Information
Vol. 18, No. 4, Hybrid Logic: Dedicated to the Memory of Volker Weber (Autumn, 2009), pp. 593-624
Published by: Springer
Stable URL: http://www.jstor.org/stable/40345511
Page Count: 32
  • Download ($43.95)
  • Cite this Item
Branching–Time Logics Repeatedly Referring to States
Preview not available

Abstract

While classical temporal logics lose track of a state as soon as a temporal operator is applied, several branching-time logics able to repeatedly refer to a state have been introduced in the literature. We study such logics by introducing a new formalism, hybrid branching-time logics, subsuming the other approaches and making the ability to refer to a state more explicit by assigning a name to it. We analyze the expressive power of hybrid branching-time logics and the complexity of their satisfiability problem. As main result, the satisfiability problem for the hybrid versions of several branching-time logics is proved to be 2EXPTIM E-complete. To prove the upper bound, the automata-theoretic approach to branching-time logics is extended to hybrid logics. As a result of independent interest, the nonemptiness problem for alternating one-pebble Büchi tree automata is shown to be 2EXPTIME-complete. A common property of the logics studied is that they refer to only one state. This restriction is crucial: The ability to refer to more than one state causes a nonelementary blow-up in complexity. In particular, we prove that satisfiability for NCTL* has nonelementary complexity.

Page Thumbnails

  • Thumbnail: Page 
[593]
    [593]
  • Thumbnail: Page 
594
    594
  • Thumbnail: Page 
595
    595
  • Thumbnail: Page 
596
    596
  • Thumbnail: Page 
597
    597
  • Thumbnail: Page 
598
    598
  • Thumbnail: Page 
599
    599
  • Thumbnail: Page 
600
    600
  • Thumbnail: Page 
601
    601
  • Thumbnail: Page 
602
    602
  • Thumbnail: Page 
603
    603
  • Thumbnail: Page 
604
    604
  • Thumbnail: Page 
605
    605
  • Thumbnail: Page 
606
    606
  • Thumbnail: Page 
607
    607
  • Thumbnail: Page 
608
    608
  • Thumbnail: Page 
609
    609
  • Thumbnail: Page 
610
    610
  • Thumbnail: Page 
611
    611
  • Thumbnail: Page 
612
    612
  • Thumbnail: Page 
613
    613
  • Thumbnail: Page 
614
    614
  • Thumbnail: Page 
615
    615
  • Thumbnail: Page 
616
    616
  • Thumbnail: Page 
617
    617
  • Thumbnail: Page 
618
    618
  • Thumbnail: Page 
619
    619
  • Thumbnail: Page 
620
    620
  • Thumbnail: Page 
621
    621
  • Thumbnail: Page 
622
    622
  • Thumbnail: Page 
623
    623
  • Thumbnail: Page 
624
    624