Recursion induction for real-time processes
- 1 November 1993
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 5 (6) , 530-553
- https://doi.org/10.1007/bf01211248
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.Keywords
This publication has 8 references indexed in Scilit:
- On the uniqueness of fixpoints modulo observation congruencePublished by Springer Nature ,2006
- A temporal calculus of communicating systemsPublished by Springer Nature ,2005
- Real time process algebraFormal Aspects of Computing, 1991
- A timed model for communicating sequential processesTheoretical Computer Science, 1988
- On the consistency of Koomen's Fair Abstraction RuleTheoretical Computer Science, 1987
- A really abstract concurrent model and its temporal logicPublished by Association for Computing Machinery (ACM) ,1986
- Elements of Recursion TheoryPublished by Elsevier ,1977
- Introduction to metric and topological spaces, by W. A. Sutherland. Pp xiii, 181. £2·50 paperback, £5 casebound. 1975. SBN 0 19 853161 3/853155 9 (Oxford University Press)The Mathematical Gazette, 1976