REASONING ABOUT TRANSFINITE SEQUENCES

DOI10.1142/S0129054107004589zbMath1109.68065MaRDI QIDQ3426789

Stéphane P. Demri, David E. Nowak

Publication date: 13 March 2007

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

zbMATH Keywords

controltemporal logicZeno behaviorphysical system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (1)

A propositional linear time logic with time flow isomorphic to \(\omega^2\)

Cites Work

• Finite divergence
• The monadic second order theory of all countable ordinals
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Propositional dynamic logic of regular programs
• A partial approach to model checking
• Reasoning about infinite computations
• Completeness of a first-order temporal logic with time-gaps
• The complexity of the temporal logic with ``until over general linear time
• Games for synthesis of controllers with partial observation.
• Future temporal logic needs infinitely many modalities
• Decidability and definability results related to the elementary theory of ordinal multiplication
• The benefits of relaxing punctuality

This page was built for publication: REASONING ABOUT TRANSFINITE SEQUENCES