Abstract
A model related to the CTS model of [KMP96] is introduced that deals with distributed systems with clocks that are not perfectly synchonized. The basis of the system is temporal logic of actions [Lam91], which ensures that the model is easily integrated with other formalisms. Verification rules and refinement rules for timed modules are proposed, and applied to a clock synchronization algorithm derived from [CAS86].
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur and D. Dill. The theory of timed automata. In de Bakker, Huizing, de Roever, and Rozenberg, editors, Real-Time: Theory in Practice, pages 45–73. Springer-Verlag, 1991.
R. Alur and D. Dill. A theory of timed automata. Theor. Comp. Sci., 126:183–235, 1994.
R. Alur and T.A. Henzinger. Real-time system = discrete system + clock variables. In T. Russ and C. Rattray, editors, Theories and Experiences for Real-time System Development, volume 2 of AMAST Series in Computing, pages 1–29. World Scientific, 1994.
M. Abadi and L. Lamport. An old-fashioned recipe for real time. ACM Toplas, 5:1543–1571, 1994.
F. Cristian, H. Aghili, and R. Strong. Clock synchronization in the presence of ommision and performance faults, and processor joins. In Proceedings 16th International Symposium on Fault-Tolerant Computing, pages 218–223, 1986.
E.C.R. Hehner. Predicative programming, part i and ii. CACM, 27:134–151, 1984.
C.A.R. Hoare. Programs are predicates. In Hoare and Sheperdson, editors, Mathematical Logic and Programming Languages. Prentice-Hall, 1985.
W. Janssen, M. Poel, Q. Xu, and J. Zwiers. Layering of real-time distributed processes. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Proceedings Formal Techniques in Real Time and Fault Tolerant Systems, LNCS 863, pages 393–417. Springer-Verlag, 1994.
Y. Kesten, Z. Manna, and A. Pnueli. Verifying clocked transition systems. In E. Sontag R. Alur, T. Henzinger, editor, Proceedings Hybrid Systems III, LNCS 1066, pages 13–40. Springer-Verlag, 1996.
L. Lamport. The temporal logic of actions. Technical Report 79, Digital Equipment Corporation, Systems Research Center, 1991.
Z. Manna et. al. Step: The Stanford temporal prover. Technical report, Stanford University, 1994.
S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6:319–340, 1976.
S. Yovine X. Nicollin, J. Sifakis. From atp to timed graphs and hybrid systems. In de Bakker, de Roever, and Rozenberg, editors, Real-Time: Theory in Practice, LNCS 600, pages 549–572. Springer-Verlag, 1992.
J. Zwiers and W.-P. de Roever. Predicates are predicate transformers: a unified theory for concurrency. In Proceedings of the ACM conference on Principles of Distributed Computing, Edmonton, Canada, august 14–16 1989. ACM.
J. Zwiers. Layering and action refinement for timed systems. In de Bakker, Huizing, de Roever, and Rozenberg, editors, Real-Time: Theory in Practice, LNCS 600, pages 687–723. Springer-Verlag, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poel, M., Zwiers, J. (1998). Synchronizing clocked transition systems. In: Ravn, A.P., Rischel, H. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1998. Lecture Notes in Computer Science, vol 1486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055346
Download citation
DOI: https://doi.org/10.1007/BFb0055346
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65003-4
Online ISBN: 978-3-540-49792-9
eBook Packages: Springer Book Archive