The taming of the states

Logic Journal of the IGPL 8 (5):681-699 (2000)
  Copy   BIBTEX

Abstract

Logic and computer science communities have traditionally followed a different approach to the problem of representing and reasoning about time and states. Research in logic resulted in a family of tense logics that take time as a primitive notion and definite states as sets of atomic propositions which are true at given instants, while research in computer science concentrated on the so-called temporal logics of programs that take state as a primitive notion, and define time as an attribute of states. In this paper, we provide a unifying framework within which the two approaches can be reconciled. Our main tools are metric and layered temporal logics originally proposed to model time granularity in various contexts. In such a framework, states and time-instants can be uniformly referred to as elements of a theory of ω-layered metric temporal structures. Furthermore, we show that the theory of timed state sequences, underlying real-time logics, is naturally recovered as an abstraction of such a theory

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,634

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2015-02-04

Downloads
14 (#1,349,184)

6 months
3 (#1,144,105)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

No references found.

Add more references