The following pages link to An axiomatization of PCTL* (Q2566222):
Displaying 10 items.
- Axiomatization of a branching time logic with indistinguishability relations (Q288245) (← links)
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- Algebraic neighbourhood logic (Q929966) (← links)
- Complexity results of STIT fragments (Q1928487) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Quantification over sets of possible worlds in branching-time semantics (Q2500778) (← links)
- Branching Time? Pruning Time! (Q2908510) (← links)
- Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions (Q3601787) (← links)
- A Labeled Natural Deduction System for a Fragment of CTL * (Q3605539) (← links)
- A natural deduction system for bundled branching time logic (Q4583318) (← links)
