AN EXPRESSIVE EXTENSION OF TLC

DOI10.1142/S0129054102001151zbMath1066.68077MaRDI QIDQ3021958

Jesper Gulmann Henriksen

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

temporal logicexpressivenessEhrenfeucht-Fraïssé gamesMazurkiewicz traces

Mathematics Subject Classification ID

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

Related Items (1)

Games for Temporal Logics on Trees

Cites Work

• Logical definability on infinite traces
• A stubborn attack on state explosion
• Results on the propositional \(\mu\)-calculus
• Automatic verification of finite-state concurrent systems using temporal logic specifications

This page was built for publication: AN EXPRESSIVE EXTENSION OF TLC