The Decidability of RPTL

Authors:
Fahad Khan
Affiliations:
University of Nottingham
Venue:
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Year:
2010

Citing 5
Cited 0

CTL and ECTL as fragments of the modal &mgr;-calculus

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
On-the-Fly Model Checking of RCTL Formulas

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Yet Another Process Logic (Preliminary Version)

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
A logic of agent programs

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we look at regular path temporal logic, RPTL, a modal logic which combines the ability to quantify over (finite) paths described by regular expressions (a property which characterises PDL) with the addition of temporal operators. The formulation of RPTL was inspired by agent programming verification considerations. In this paper we prove the decidabilty of RPTL and establish complexity bounds on the satisfiability problem for RPTL by translating it into the theory of alternating tree automata on infinite trees.