On Non-local Propositional and Weak Monodic Quantified CTL*

  • Authors:

  • Sebastian Bauer;Ian Hodkinson;Frank Wolter;Michael Zakharyaschev

  • Affiliations:

  • Institut füur Informatik, Universität Leipzig, Augustus-Platz 10-11, 04109 Leipzig, Germany. E-mail: bauer@informatik.uni-leipzig.de;Department of Computing, Imperial College, 180 Queen's Gate, London SW7 2BZ, UK. E-mail: imh@doc.ic.ac.uk;Department of Computer Science, Liverpool University, Liverpool L69 7ZF, UK. E-mail: frank@csc.liv.ac.uk;Department of Computer Science, King's College, Strand, London WC2R 2LS, UK. E-mail: mz@dcs.kcl.ac.uk

  • Venue:
  • Journal of Logic and Computation
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional PCTL*, in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified PCTL*, where the next-time operator can be applied only to formulas with at most one free variable, all other temporal operators and path quantifiers are applicable only to sentences, and the first-order constructs follow the pattern of any of several decidable fragments of first-order logic.