Branching-time logics and fairness, revisited

DOI10.1017/S0960129521000475zbMath1498.68163OpenAlexW4285355770MaRDI QIDQ5084315

Markus Latte

Publication date: 24 June 2022

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129521000475

zbMATH Keywords

fairnessexpressivitypropositional dynamic logicbranching-time logicdiagonalisationcomputation-tree logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propositional dynamic logic of regular programs
• Decision procedures and expressiveness in the temporal logic of branching time
• Temporal Logics in Computer Science
• Looping vs. repeating in dynamic logic
• “Sometimes” and “not never” revisited
• Extended Computation Tree Logic
• The Common Fragment of ACTL and LTL

This page was built for publication: Branching-time logics and fairness, revisited