Abstract
A technique for the specification of TCSP processes based upon the concept of states and state variables is presented. It is shown how safety and liveness properties can be proved for processes specified in this way. Parallel composition of specifications is defined, preserving the failures semantics. 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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L.M. Alonso and R. Pena. 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, volume LNCS 506, pages 75–91. Springer-Verlag, 1991.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, London, 1985.
R. Pena and L.M. Alonso. Specification and Verification of TCSP Systems by means of Partial Abstract Types. In E.H.L. Aarts, J. van Leeuwen, and M. Rem, editors, TAPSOFT'89: Theory and Practice of Software Engineering, volume LNCS 352, pages 328–244. Springer-Verlag, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alonso, L.M., Peña Mari, R. (1993). Using state variables for the specification and verification of TCSP processes. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_43
Download citation
DOI: https://doi.org/10.1007/3-540-56891-3_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56891-9
Online ISBN: 978-3-540-47779-2
eBook Packages: Springer Book Archive