On the equivalence of automaton-based representations of time granularities

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn , Issue , 2007, Pages 82-93

  Dal Lago, Ugo ^a   Montanari, Angelo ^b   Puppis, Gabriele ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; LINEAR EQUATIONS; NUCLEAR PROPULSION; ROBOTS; TRANSLATION (LANGUAGES);

BUCHI AUTOMATA; DIOPHANTINE EQUATIONS; EQUIVALENCE PROBLEMS; INFINITE WORDS; INTERNATIONAL SYMPOSIUM; NP COMPLETE; SATISFIABILITY (SAT) PROBLEMS; TEMPORAL DOMAINS; TIME GRANULARITIES;

AUTOMATA THEORY;

EID: 47349100789     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2007.56     Document Type: Conference Paper

References (20)

1. K. Aardal, C. A. Hurkens, and A. Lenstra. Solving a system of linear diophantine equations with lower and upper bounds on the variables. Mathematics of Operations Research, 25(3):427-442, 2000.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. C. Bettini, S. Jajodia, and X. Wang. Time Granularities in Databases, Data Mining, and Temporal Reasoning. Springer, July 2000.
4. D. Bresolin, A. Montanari, and G. Puppis. Time granularities and ultimately periodic automata. In Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA), volume 3229 of LNCS, pages 513-525. Springer, 2004.
5. C. Combi, M. Franceschet, and A. Peron. Representing and reasoning about temporal granularities. Journal of Logic and Computation, 14:51-77, 2004.
6. H. Comon and V. Cortier. Flatness is not a weakness. In Proceedings of the 14th International Conference on Computer Science Logic (CSL), volume 1862 of LNCS, pages 262-276. Springer, 2000.
7. U. Dal Lago and A. Montanari. Calendars, time granularities, and automata. In Proceedings of the 7th International Symposium on Spatial and Temporal Databases (SSTD), volume 2121 of LNCS, pages 279-298. Springer, 2001.
8. U. Dal Lago, A. Montanari, and G. Puppis. Towards compact and tractable automaton-based representations of time granularity. In Proceedings of the 8th Italian Conference on Theoretical Computer Science (ICTCS), volume 2841 of LNCS, pages 72-85. Springer, 2003.
9. U. Dal Lago, A. Montanari, and G. Puppis. Compact and tractable automaton-based representations for time granularities. Theoretical Computer Science, 373(1-2):115-141, 2007.
10. S. Demri. LTL over integer periodicity constraints. In I. Walukiewicz, editor, Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), volume 2987 of LNCS, pages 121-135. Springer, 2004.
11. J. Euzenat and A. Montanari. Time granularity. In M. Fisher, D. Gabbay, and L. Vila, editors, Handbook of Temporal Reasoning in Artificial Intelligence, pages 59-118. Elsevier, 2005.
12. S. Ginsburg and E. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics, 16(2):285-296, 1966.
13. T. Henzinger and R. Majumdar. A classification of symbolic transition systems. In Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 1770 of LNCS, pages 13-34. Springer, 2000.
14. D. Knuth, J. Morris, and V. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6:323-350, 1977.
15. B. Leban, D. McDonald, and D. Foster. A representation for collections of temporal intervals. In Proceedings of the AAAI National Conference on Artificial Intelligence, volume 1, pages 367-371. AAAI Press, 1986.
16. M. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967.
17. M. Niezette and J. Stevenne. An efficient symbolic representation of periodic time. In Proceedings of the International Conference on Information and Knowledge Management (CIKM), pages 161-168, Baltimore, MD, 1992. ACM Press.
18. P. Ning, S. Jajodia, and X. Wang. An algebraic representation of calendars. Annals of Mathematics and Artificial Intelligence, 36:5-38, 2002.
19. D. Perrin and P. Schupp. Automata on integers, recurrence distinguishability, and the equivalence and decidability of monadic theories. In Proceedings of the Symposium on Logic in Computer Science (LICS), pages 301-304. IEEE Computer Society, 1986.
20. J. Wijsen. A string-based model for infinite granularities. In C. Bettini and A. Montanari, editors, Proceedings of the AAAI Workshop on Spatial and Temporal Granularities, pages 9-16. AAAI Press, 2000.