An axiomatization of PCTL*

DOI10.1016/j.ic.2005.03.005zbMath1099.03013OpenAlexW2083732130MaRDI QIDQ2566222

M. A. Reynolds

Publication date: 22 September 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2005.03.005

zbMATH Keywords

AxiomatizationBranching timeTemporal Logic

Mathematics Subject Classification ID

Temporal logic (03B44)

Related Items (10)

Axiomatization of a branching time logic with indistinguishability relations ⋮ Branching Time? Pruning Time! ⋮ A natural deduction system for bundled branching time logic ⋮ Complexity results of STIT fragments ⋮ A survey on temporal logics for specifying and verifying real-time systems ⋮ A tableau-based decision procedure for CTL\(^*\) ⋮ Algebraic neighbourhood logic ⋮ Quantification over sets of possible worlds in branching-time semantics ⋮ Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions ⋮ A Labeled Natural Deduction System for a Fragment of CTL *

Cites Work

• A hierarchy of temporal logics with past
• Temporal aspects of logical procedure definition
• Specification in CTL + past for verification in CTL.
• An axiomatization of full Computation Tree Logic
• Deciding full branching time logic
• “Sometimes” and “not never” revisited
• Logic and time
• Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL
• Branching-time logic with quantification over branches: The point of view of modal logic
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An axiomatization of PCTL*