scientific article; zbMATH DE number 1392300

zbMath0945.03554MaRDI QIDQ4936139

Moshe Y. Vardi

Publication date: 25 January 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (4)

Size-Change Termination and Satisfiability for Linear-Time Temporal Logics ⋮ Branching vs. Linear Time: Semantical Perspective ⋮ Linear temporal logic symbolic model checking ⋮ Is your model checker on time? On the complexity of model checking for timed modal logics

Uses Software

• CESAR

This page was built for publication: