Past is for free: On the complexity of verifying linear temporal properties with past

DOI10.1007/s00236-003-0136-5zbMath1084.68073OpenAlexW1992762998MaRDI QIDQ1889855

Nicolas Markey

Publication date: 13 December 2004

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-003-0136-5

zbMATH Keywords

model checkinglinear-time temporal logic with past

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (9)

Some modal aspects of XPath ⋮ Social bot detection as a temporal logic model checking problem ⋮ A Cookbook for Temporal Conceptual Data Modelling with Description Logics ⋮ Towards a notion of unsatisfiable and unrealizable cores for LTL ⋮ Backdoors for linear temporal logic ⋮ AN NP-COMPLETE FRAGMENT OF LTL ⋮ The Complexity of Satisfiability for Fragments of CTL and CTL⋆ ⋮ The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments ⋮ THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆

This page was built for publication: Past is for free: On the complexity of verifying linear temporal properties with past