Abstract
Adequate methods for checking the specification and design of distributed systems must allow for reasoning about asynchronous activities; efficient methods must perform the reasoning in polynomial time. This paper lays the groundwork for such an efficient deductive system by providing a very general temporal relation algebra that can be used by constraint propagation techniques to perform the required reasoning. Major choices exist when selecting an appropriate temporal model: discrete/dense, linear/nonlinear, and point/interval. James Allen and others have indicated the possible atomic relations between two intervals for the dense-linear-interval model, while Anger, Ladkin, and Rodriguez have shown those needed for a dense-branching-interval model. Rodriguez and Anger further developed a dense-relativistic-interval model based on Lamport'sprecede andcan affect arrows, determining a large number of atomic relations. This paper shows that those same atomic relations are exactly the correct ones for intervals in dense relativistic space-time if intervals are taken as pairs of points (E s ,E f ) in space-time such that it is possible to move fromE s toE f at less than the speed of light. The relations are defined and named consistently with the earlier work of Rodriguez and Anger, and the relationship between the two models is pursued. The relevance of the results to the verification of distributed specifications and algorithms is discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Clifford and D. Warren, “Formal semantics for time in databases,”ACM Trans. Database Syst. vol. 8, no. 2, pp. 214–254, 1983.
R. Loganantharaj, “Representation and compilation of knowledge in point-based temporal system,”Int. J. Intell. Syst. vol. 6, no. 5, pp. 549–567, 1991.
R. Snodgrass, “The temporal query language TQUEL,”ACM Trans. Database Syst. vol. 12, no. 2, pp. 247–298, 1987.
T. Dean, “Large-scale temporal data bases for planning in complex domains,”Proc. Int. Joint Conf. Artif. Intell., Milan, Italy, August 1987, pp. 860–866.
D. McDermott, “A temporal logic for reasoning about processes and plans,”Cogn. Sci. vol. 6, pp. 101–155, 1982.
U. Abraham, S. Ben-David, and M. Magidor, “On global-time inter-process communication,” inSemantics for Concurrency, edited by M. Kwiatkowska, M. Shields, and R. Thomas, Springer-Verlag: Leicester, 1990.
Z. Manna and P. Wolper, “Synthesis of communication processes from temporal logic specifications,”ACM Trans. Programming Languages Syst. vol. 6, no. 1, pp. 68–93, 1984.
A. Pnueli, “The temporal semantics of concurrent programs,”Proc. 18th Symp. Foundations Comput. Sci., IEEE, Providence, RI, November 1977, pp. 46–57.
L. Lamport, “Time, clocks and the ordering of events in a distributed system,”Commun. ACM vol. 21, no. 7, pp. 558–565, 1978.
L. Lamport, “The mutual exclusion problem: Part I—A theory of interprocess communication,”J. ACM vol. 33, no. 2, pp. 313–326, 1986.
E. Clarke, E. Emerson, and A. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic specifications,”ACM Trans. Programming Languages Syst. vol. 8, no. 2, pp. 244–263, 1986.
S. Honiden, N. Uchihira, K. Matsumoto, and M. Arai, “An application of structural modeling and automated reasoning to real-time systems design,”Real-Time Syst. vol. 1, no. 4, pp. 313–331, 1990.
P. Wolper, “Synthesis of communicating processes from temporal logic specification,”STAN-CS-82-925, Stanford University, Stanford, CA, 1982.
F. Anger, “On Lamport's interprocessor communication model,”ACM Trans. Programming Language Syst. vol. 11, no. 3, pp. 404–417, 1989.
S. Ben-David, “The global time assumption and semantics for concurrent systems,”Proc. 7th ACM Symp. Princ. Distrib. Comput., Toronto, 1988, pp. 223–231.
E. Emerson and J. Halpern, “‘Sometimes’ and ‘not never’ revisited: on branching versus linear time temporal logic,”J. ACM vol. 33, no. 1, pp. 151–178, 1986.
R. Rodriguez and F. Anger, “Prior's legacy in computer science,” inThe Arthur Prior Memorial Volume, edited by J. Copeland, Oxford University Press: Oxford, 1991.
J. van Benthem,A Manual of Intensional Logic, 2nd ed., Center for the Study of Language and Information (CSLI): Stanford, CA, 1988.
J. van Benthem, ‘Time, logic and computation,” inLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency, edited by J. de Bakker, W.-P. de Roever, and G. Rozenberg, Springer-Verlag: New York, 1989, pp. 1–49.
P. Ladkin and R. Maddux, “On binary constraint networks,” Technical Report KES.U.88.8, Kestrel Institute, 1988, Palo Alto, CA.
F. Anger, P. Ladkin, and R. Rodriguez, “Atomic temporal interval relations in branching time: calculation and application,”Applications of Artificial Intelligence IX, SPIE, Orlando, FL, April 1991, pp. 122–136.
R. Rodriguez, F. Anger, and K. Ford, “Temporal reasoning: a relativistic model,”Int. J. Intell. Syst. vol. 6, pp. 237–254, 1991.
R. Goldblatt, “Diodorean modality in Minkowski spacetime,”Studia Logica vol. 39, no. 2/3, pp. 219–236, 1980.
P. Ladkin and R. Maddux, “Representation and reasoning with convex time intervals,” Technical Report KES.U. 88.2, Kestrel Institute, 1988, Palo Alto, CA.
J. Allen, “Maintaining knowledge about temporal intervals,”Commun. ACM vol. 26, no. 11, pp. 832–843, 1983.
F. Anger and R. Rodriguez, “F-complexes: a set theoretic approach to temporal modeling,”IEA/AIE91: Proc. Fourth Int. Conf. Indust. Eng. App. Artif. Intell. Expert Syst., Hawaii, June 1991, pp. 609–617.
F. Anger and R. Rodriguez, “Time, tense, and relativity revisited,” inLecture Notes in Computer Science, edited by B. Bouchon-Meunier, R. Yager, and L. Zadeh, Springer-Verlag: New York, 1991, pp. 286–295.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rodriguez, R.V. A relativistic temporal algebra for efficient design of distributed systems. Appl Intell 3, 31–45 (1993). https://doi.org/10.1007/BF00871721
Issue Date:
DOI: https://doi.org/10.1007/BF00871721