Advertisement

Calendars, Time Granularities, and Automata

  • Ugo Dal Lago
  • Angelo Montanari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2121)

Abstract

The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, temporal data conversion, temporal database inter-operability, temporal constraint reasoning, data mining, and time management in workflow systems. According to a commonly accepted view, any time granularity can be viewed as the partitioning of a temporal domain in groups of elements, where each group is perceived as an indivisible unit (a granule). Most granularities of practical interest are modeled as infinite sequences of time granules, that present a repeating pattern and, possibly, temporal gaps within and between granules. Even though conceptually clean, this definition does not address the problem of providing infinite granularities with a finite representation to make it possible to deal with them in an effective way. In this paper, we present an automata-theoretic solution to such a problem that revises and extends the string-based model recently proposed by Wijsen [13]. We illustrate the basic features of our formalism and discuss its application to the fundamental problems of equivalence and classification of time granularities.

Keywords

Temporal Domain Time Granularity Loop State Temporal Database Extrinsic Characteristic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Alur and T. Henzinger. Real-time logics: Complexity and expressiveness. Information and Computation, (104):35–77, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    C. Bettini and R. De Sibi. Symbolic Representation of User-Defined Time Granularities. Annals of Mathematics and Artificial Intelligence, 30(1–4), 2001.Google Scholar
  3. 3.
    C. Bettini, C. E. Dyreson, W. S. Evans, R. T. Snodgrass, and X. S. Wang, A glossary of time granularity concepts. In: Temporal Databases: Research and Practice, O. Etzion, S. Jajodia, and S. Sripada (Eds.), LNCS 1399, pages 406–413, Springer, 1998.CrossRefGoogle Scholar
  4. 4.
    C. Bettini, X. S. Wang, and S. Jajodia. Satisfiability of quantitative temporal constraints with multiple granularities. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming, LNCS 1330, pages 435–449, Springer, 1997.CrossRefGoogle Scholar
  5. 5.
    C. Bettini, X. S. Wang, and S. Jajodia. A general framework for time granularity and its application to temporal reasoning. Annals of Mathematics and Artificial Intelligence, 22(1–2):29–58, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    C. Bettini, X. S. Wang, and S. Jajodia. Time Granularities in Databases, Data Mining, and Temporal Reasoning. Springer, 2000.Google Scholar
  7. 7.
    B. Leban, D. McDonald, and D. Foster. A representation for collections of temporal intervals. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 367–371, AAAI Press, 1986.Google Scholar
  8. 8.
    M. Niezette and J. Stevenne. An efficient symbolic representation of periodic time. In: Proceedings of the International Conference on Information and Knowledge Management, pages 161–168, ACM Press, 1992.Google Scholar
  9. 9.
    P. Ning, X. S. Wang, and S. Jajodia. An algebraic representation of calendars. In: Proceedings of the AAAI Workshop on Spatial and Temporal Granularity, C. Bettini and A. Montanari (Eds.), pages 1–8, AAAI Press, 2000.Google Scholar
  10. 10.
    D. Perrin and P.E. Schupp. Automata on the integers, recurrence distinguishability, and the equivalence and decidability of monadic theories. In: Proceedings of the IEEE Symposium on Logic in Computer Science (LICS), pages 301–304, IEEE, 1986.Google Scholar
  11. 11.
    M. Soo and R. Snodgrass. Mixed Calendar Query Language Support for Temporal Constants. The MultiCal Project, Release 1.1, Department of Computer Science, The University of Arizona, Tucson, AZ, September 1995.Google Scholar
  12. 12.
    W. Thomas. Languages, Automata, and Logic. In: Handbook of formal languages, Vol. 3, G. Rozemberg and A. Salomaa (Eds.), pages 389–455, Springer, 1997.Google Scholar
  13. 13.
    J. Wijsen. A string-based model for infinite granularities. In: Proceedings of the AAAI Workshop on Spatial and Temporal Granularity, C. Bettini and A. Montanari (Eds.), pages 9–16, AAAI Press, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Ugo Dal Lago
    • 1
  • Angelo Montanari
    • 1
  1. 1.Dipartimento di Matematica e InformaticaUniversità di UdineUdineItaly

Personalised recommendations