Process simulation and refinement
In this paper we deal with the problem of (nondeterministic and parallel) process refinement. The basic notion of refinement is defined via the improved failure semantics of CSP [BHR84, BrR85, Hoa85, Ros88]. The concept of simulation of Communicating Systems introduced in [Mil80, Par81] is generalised and proved to be sound for the correctness of refinement. A Galois connection is presented to show that up-simulation and down-simulation together provide a complete proof method. The paper also suggests that simulation can be employed to derive an implementation from a specification.
Key wordsSimulation Refinement
Unable to display preview. Download preview PDF.
- [BHR84]Brookes, S. D., Hoare, C. A. R. and Roscoe, A. W.: A Theory of Communicating Sequential Processes.J. ACM, 31(3), 560–599 (1984).Google Scholar
- [BrR85]Brookes, S. D. and Roscoe, A. W.,An Improved Failures Model for Communitating Processes. Lecture Notes in Computer Science 197, Springer-Verlag, 1985.Google Scholar
- [HeS73]Herrlich, H. and Strecker, G. E.:Category Theory. Allyn and Bacon, 1973.Google Scholar
- [Hoa85]Hoare, C. A. R.:Communicating Sequential Processes. Prentice-Hall International Series in Computer Science, 1985.Google Scholar
- [HoJ87]Hoare, C. A. R. and He, J.: The Weakest Prespecification.Inform. Process. Lett. 24(2), 127–132 (1987).Google Scholar
- [Mil80]Milner, R.:A Calculus of Communicating System. Lecture Notes in Computer Science 92. Springer Verlag, 1980.Google Scholar
- [Par81]Park, D.:Concurrency and Automata on Infinite Sequences. Lecture Notes in Computer Science 104, pp. 167–183. Springer-Verlag 1981.Google Scholar
- [Ros88]Roscoe, A. W.:Recent Developments in CSP. Oxford University Technical Monograph PRG-67, 1988.Google Scholar
- [Sch53]Schmidt, J.: Beitrage zue Filtertheorie. II.Math Nachr., 10, 197–232 (1953).Google Scholar