Arrow Research search
Back to CSL

CSL 2015

Temporal Logics with Local Constraints (Invited Talk)

Conference Paper Accepted Paper Logic in Computer Science ยท Theoretical Computer Science

Abstract

Recent decidability results on the satisfiability problem for temporal logics, in particular LTL, CTL* and ECTL*, with constraints over external structures like the integers with the order or infinite trees are surveyed in this paper.

Authors

Keywords

  • Temporal logics with constraints
  • concrete domains
  • LTL
  • CTL*
  • ECTL*

Context

Venue
Annual Conference on Computer Science Logic
Archive span
1988-2026
Indexed papers
1413
Paper id
532410384748494520