Decidability results for metric and layered temporal logics

Notre Dame Journal of Formal Logic

Volumn 37, Issue 2, 1996, Pages 260-283

  Montanari, Angelo ^a   Policriti, Alberto ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974664310     PISSN: 00294527     EISSN: 19390726     Source Type: Journal    
DOI: 10.1305/ndjfl/1040046089     Document Type: Article

References (20)

1. Alur, R., and T. A. Henzinger, “Real-time logics: complexity and expressiveness,” Information and Computation, vol. 104 (1993), pp. 35-77.
2. Büchi, J. R., “Weak second-order arithmetic and finite automata,” Zeitschrift für mathematishce Logik und Grundlagen der Mathematik, vol. 6 (1960), pp. 66-92.
3. Büchi, J. R., “On a decision method in restricted second-order arithmetic,” pp. 1-11 in Proceedings of 1st International Congress on Logic, Methodology, and Philosophy of Science edited by E. Nagel, P. Suppes, and A. Tarski, Stanford University Press, Stanford, 1962.
4. Ciapessoni, E., E. Corsetti, A. Montanari, and P. San Pietro, “Embedding time granularity in a logical specification language for synchronous real-time systems,” Science of Computer Programming, vol. 20 (1993), pp. 141-171.
5. D’Agostino, G., A. Montanari, and A. Policriti, “A set-theoretic translation method for polymodal logics,” Journal of Automated Reasoning, vol. 15 (1995), pp. 317-337.
6. Ershov, Y. L., I. A. Lavrov, A. D. Taimanov, and M. A. Taitslin, “Elementary theories,” Russian Mathematical Surveys, vol. 20 (1965), pp. 35-105.
7. Euzenat, J., “An algebraic approach for granularity in qualitative space and time representation,” pp. 894-900 in Proceedings of IJCAI’95, Morgan Kaufmann, San Mateo, 1995. 1.
8. Fiadeiro, J. and T. Maibaum, “Sometimes ‘Tomorrow’ is ‘Sometimes’-action refinement in a temporal logic of objects,” pp. 48-66 in Proceedings of ICTL’94, LNAI 827, Springer-Verlag, Berlin, 1992. 1.
9. Finger, M., and D. Gabbay, “Combining temporal logic systems,” Notre Dame Journal of Formal Logic, vol. 37 (1996), pp. 204-232.
10. Gabbay, D., A. Pnueli, S. Shelah, and J. Stavi, “On the temporal analysis of fairness,” pp. 163-173 in Proceedings of the 7th Annual Symposium on Principles of Programming Languages, ACM Press, New York, 1980. 3.1.
11. Koymans, R., “Specifying message passing and time-critical systems with temporal logic,” LNCS 651, Springer-Verlag, Berlin, 1992.
12. Manna, Z., and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer-Verlag, Berlin, 1992.
13. Montanari, A., “A metric and layered temporal logic for time granularity, synchrony and asynchrony,” pp. 49-58 in Proceedings of the ICTL’94 Workshop, MPI-I-94-230, edited by H. J. Ohlbach, Max-Planck-Institut für Informatik, Saarbruecken,1994. 1.
14. Montanari, A., and M. de Rijke, “Completeness results for two-sorted metric temporal logics,” pp. 385-399 in Proceedings of the AMAST’95, LNCS 936, Springer-Verlag, Berlin, 1995. 1, 1.
15. Montanari, A., and A. Policriti, “A decidable theory of finitely-layered metric temporal structures,” Report ML-96-06, ILLC, University of Amsterdam, July, 1996. 4.
16. Montanari, A., A. Peron, and A. Policriti, “Decidabable theories of ω-layered metric temporal structures,” Report ML-96-07, ILLC, University of Amsterdam, July, 1996. 4.
17. Rabin, M. O., “Decidable theories,” pp. 595-629 in Handbook of Mathematical Logic, edited by J. Barwise, North-Holland, Ansterdam, 1977.
18. Thomas, W., “Automata on infinite objects,” pp. 131-191 in Handbook of Theoretical Computer Science, edited by J. van Leeuwen, Elsevier, Amsterdam, 1990.
19. van Benthem J., “Temporal logic,” pp. 241-350 in Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 4, edited by D. Gabbay, C. Hogger, and J. Robinson, Oxford University Press, Oxford,1995.
20. Wang, X., C. Bettini, A. Brodsky, and S. Jajodia, “Logical design for temporal databases with multiple granularities,” forthcoming in ACM TODS. 1.