On non-local propositional and weak monodic quantified CTL

Bauer, S. and Hodkinson, I.M. and Wolter, F. and Zakharyaschev, Michael (2004) On non-local propositional and weak monodic quantified CTL. Journal of Logic and Computation 14 (1), pp. 3-22. ISSN 0955-792X.

Full text not available from this repository.

Official URL: https://doi.org/10.1093/logcom/14.1.3

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.

Metadata

Item Type:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	01 Nov 2021 13:18
Last Modified:	09 Aug 2023 12:52
URI:	https://eprints.bbk.ac.uk/id/eprint/46552

Statistics

Archive Staff Only (login required)

Edit/View Item