Abstract
In this paper, we present a timed calculus, Timed CCS, which is an extension of Milner's CCS with time. We allow time to be discrete, such as the integers or the natural numbers, or dense, such as the rationals or the reals. We extend the notion of strong bisimulation to timed processes and show that the largest strong bisimulation is decidable. The decidability is independent of the choice of the time domain.
The author is supported by a TC Scholarship.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493–574. Elsevier, 1990. Vol. B.
R. Chadha and D.A. Plaisted. Correctness of unification without occur check in Prolog. Technical report, Department of Computer Science, University of North Carolina, Chapel Hill, N.C., 1991.
P. Deransart, G. Ferrand, and M. Téguia. NSTO programs (not subject to occurcheck). In V. Saraswat and K. Ueda, editors, Proceedings of the International Logic Symposium, pages 533–547. The MIT Press, 1991.
P. Dembinski and J. Maluszynski. AND-parallelism with intelligent backtracking for annotated logic programs. In Proceedings of the International Symposium on Logic Programming, pages 29–38, Boston, 1985.
P. Deransart and J. Maluszynski. Relating Logic Programs and Attribute Grammars. Journal of Logic Programming, 2:119–156,1985.
W. Drabent. Do Logic Programs Resemble Programs in Conventional Languages? In International Symposium on Logic Programming, pages 389–396. San Francisco, IEEE Computer Society, August 1987.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, second edition, 1987.
J.-L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587–625. Morgan Kaufmann, Los Altos, Ca., 1988.
A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4:258–282, 1982.
A. Pellegrini. Sul problema dell' ”occur check” in Prolog. Technical report, Department of Computer Science, University of Padova, Padova, Italy, 1992. Tesi di Laurea, in Italian, to appear.
D.A. Plaisted. The occur-check problem in Prolog. In Proc. International Conference on Logic Programming, pages 272–280. IEEE Computer Science Press, 1984.
D.A. Rosenblueth. Using program transformation to obtain methods for eliminating backtracking in fixed-mode logic programs. Technical Report 7, Universidad Nacional Autonoma de Mexico, Instituto de Investigaciones en Matematicas Aplicadas y en Sistemas, 1991.
L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L. (1992). An interleaving model for real-time systems. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023865
Download citation
DOI: https://doi.org/10.1007/BFb0023865
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55707-4
Online ISBN: 978-3-540-47276-6
eBook Packages: Springer Book Archive