Abstract
A technique for the specification of TCSP processes based upon the concepts of guards and liveness rules is presented. It is shown how safety and liveness properties can be proved for processes specified in this way. A technique related to bisimulations is proposed to prove refinements correct. The technique is extended to handle the concealment of events in the implementing process. The refinement relation preserves the safety and liveness properties already proved for the specification. Parallel composition of specifications is also defined preserving the failures semantics. To illustrate the technique, an example is used throughout the paper.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L.M. Alonso. Técnicas formales para el desarrollo jerárquico de sistemas concurentes. PhD thesis, Universidad del País Vasco, 1992.
L.M. Alonso and R. Peña. Acceptance automata: a framework for specifying and verifying TCSP parallel systems. In E.H.L. Aarts, J. van Leeuwen, and M. Rem, editors, PARLE'91: Parallel Architectures and Languages Europe, pages 75–91, Springer-Verlag, 1991.
L.M. Alonso and R. Peña. Using state variables for the specification and verification of TCSP processes. Internal report DIA-UCM-92.3, Dep. Informática y Automática, Univ. Complutense de Madrid, Spain, 1–26, 1992.
J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77–121, 1985.
S.D. Brookes. A Model for Communicating Sequential Processes. PhD thesis, Oxford University, 1983.
S.D. Brookes, A.W. Roscoe, and C.A.R. Hoare. A theory for communicating sequential processes. Journal of the ACM, 31:560–599, 1984.
M. Broy and M. Wirsing. Partial abstract types. Acta Informatica, 18:47–64, 1982.
M. Hennessy. Algebraic Theory of Processes. MIT Press, London, 1989.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, London, 1985.
C.A.R. Hoare. Proof of correctness of data representations. Acta Informatica, 1:271–281, 1972.
H. Jifeng. Process simulation and refinement. Formal Aspects of Computing, 1:229–241, 1989.
R. Milner. A Calculus of Communicating Systems. Volume 92 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1980.
R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989.
D. Park. Concurrency and automata on infinite sequences. In E.H.L. Aarts, J. van Leeuwen, and M. Rem, editors, Proceedings 5th GI Conf. of Theoretical Computer Science, pages 245–251, Springer-Verlag, 1981. Lecture Notes in Computer Science.
R. Peña and L.M. Alonso. Specification and Verification of TCSP Systems by Means of Partial abstract Types. In J. Diaz; F. Orejas, editor, TAPSOFT'89: Theory and Practice of Software Development, Vol. 2, pages 328–344, Springer-Verlag, 1989. Lecture Notes in Computer Science no. 352.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peña, R., Alonso, L.M. (1993). A technique for specifying and refining TCSP processes by using guards and liveness conditions. In: Gaudel, M.C., Jouannaud, J.P. (eds) TAPSOFT'93: Theory and Practice of Software Development. CAAP 1993. Lecture Notes in Computer Science, vol 668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56610-4_74
Download citation
DOI: https://doi.org/10.1007/3-540-56610-4_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56610-6
Online ISBN: 978-3-540-47598-9
eBook Packages: Springer Book Archive