On Non-local Propositional and Weak Monodic Quantified CTL*

DOI10.1093/logcom/14.1.3zbMath1046.03007OpenAlexW1999942765MaRDI QIDQ4461349

No author found.

Publication date: 30 March 2004

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/14.1.3

zbMATH Keywords

decidabilitybranching-time temporal logicCTL*predicate temporal logicnon-local semantics

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (5)

A Tableau for Bundled Strategies ⋮ Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting ⋮ Rewrite rules for \(\mathrm{CTL}^\ast\) ⋮ Quantification over sets of possible worlds in branching-time semantics ⋮ Complexity of monodic guarded fragments over linear and real time

This page was built for publication: On Non-local Propositional and Weak Monodic Quantified CTL*