Branching within time: An expressively complete and elementarily decidable temporal logic for time granularity

DOI10.1023/A:1024643624349zbMath1082.68066MaRDI QIDQ1768798

Angelo Montanari, Massimo Franceschet

Publication date: 15 March 2005

Published in: Research on Language and Computation (Search for Journal in Brave)

zbMATH Keywords

temporal logicstime granularityspecification and verification of programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (1)

Definability and decidability of binary predicates for time granularity

This page was built for publication: Branching within time: An expressively complete and elementarily decidable temporal logic for time granularity