Abstract
The theory of timed Communicating Sequential Processes is a mathematical approach to the design and analysis of timed distributed systems. This paper extends the language of timed CSP to include a general treatment of recursion. A semantics for mutual recursion is introduced, together with a sufficient condition for the necessary fixpoint to be unique. The resulting language has the familiar unwinding property of process algebra, and exhibits a number of useful algebraic identities. A theory of recursion induction is formulated, and a simple example is presented to illustrate its use.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baeten, J. C. M. and Bergstra, J. A.: Real time process algebra.Formal Aspects of Computing 3:142–188 (1991).
Baeten, J. C. M., Bergstra, J. A. and Klop, J. W.: On the consistency of Koomen's fair abstraction rule.Theoretical Computer Science 51 (1987).
Barringer, H., Kuiper R. and Pnueli, A.: A really abstract concurrent model and its temporal logic.Proceedings of the 13th ACM Symposium on the Principles of Programming Languages, 1985.
Brinksma, E.: On the uniqueness of fixpoints modulo observation congruence.Proceedings of CONCUR 92, Springer LNCS 630, 1992.
Davies, J. W. and Schneider, S. A.:Factorising proofs in timed CSP. Proceedings of the Fifth Conference on the Mathematical Foundations of Programming Semantics, Springer LNCS 439, 1989.
Davies, J. W.:Specification and proof in real-time systems. Programming Research Group Technical Monograph PRG-93, Oxford University, 1991.
Enderton, H. B.:Elements of Set Theory. Academic Press, 1977.
Hennessy, M. and Regan, T.:A Temporal Process Algebra. Technical Report 2-90, University of Sussex, 1990.
Hoare, C. A. R.:Communicating Sequential Processes. Prentice-Hall International, 1985.
Moller, F. and Tofts, C.:A temporal calculus of communicating systems. Proceedings of CONCUR 90, Springer LNCS 458, 1990.
Nicollin, X., Richier, J.-L., Sifakis, J. and Voiron, J.:ATP: an algebra for timed processes. Proceedings of the IFIP Working Conference on Programming Concepts and Methods, 1990.
Reed, G. M.:A uniform mathematical theory for real-time distributed computing. Oxford University D.Phil thesis, 1988.
Reed, G. M. and Roscoe, A. W.:A timed model for communicating sequential processes. Proceedings of ICALP'86, Springer LNCS 226 314–323, 1986,Theoretical Computer Science 58; 249–261, (1988).
Roscoe, A. W.: Amathematical theory of communicating processes. Oxford University D.Phil thesis, 1982.
Schneider, S. A.:Correctness and communication in real-time systems. Programming Research Group Technical Monograph PRG-84, Oxford University, 1990.
Sutherland, W. A.:Introduction to Metric and Topological Spaces. Oxford University Press, 1975.
Wang Yi.:A calculus of real time systems. Ph.D thesis, Chalmers University of Technology, 1991.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Davies, J., Schneider, S. Recursion induction for real-time processes. Formal Aspects of Computing 5, 530–553 (1993). https://doi.org/10.1007/BF01211248
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01211248