Flat fragments of CTL and CTL: separating the expressive and distinguishing powers

DOI10.1093/jigpal/7.1.55zbMath0920.03031OpenAlexW2128635895MaRDI QIDQ4238500

Dennis Dams

Publication date: 5 May 1999

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/7.1.55

zbMATH Keywords

bisimulationexpressive powerlinear timebranching timecomputation tree logicLTLCTLdistinguishing powerflat temporal logicsuntil modality

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items

On the freeze quantifier in Constraint LTL: Decidability and complexity ⋮ Taming strategy logic: non-recurrent fragments ⋮ Linear-time temporal logics with Presburger constraints: an overview ★ ⋮ The complexity of propositional linear temporal logics in simple cases