Abstract
We consider the systems composed of a finite set of asynchronously cooperating subsystems. The subsystems may communicate with each other by sending or receiving synchronization messages. Each particular synchronization message has a unique sender and a unique receiver. Such set of subsystems is called “broadcasting-free”. We show how to generate a global description of the system from the descriptions of its subsystems provided they cooperate by means of the synchronization mechanism called rendez-vous. We show also how to validate the system behaviours. The susbystems and the whole system will be modelled by abstract machines defined in the paper.
This work has been done in the framework of the cooperation between the Agence de l’Informatique and the Compagnie BULL
On leave of absence from the Institute of Computer Science, Warsaw Technical University, 00-665 Warsaw, Poland
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bochman G.V., Finite State Description of Communication Protocols, Comp. Network, Vol. 2 Oct 1978.
Bochman G.V., Structured Specification of Communicating Systems, IEEE Transaction on Comp. Vol. 0–32, Feb.1983, pp. 120–133
Brand D.,Joyner H.Jr., Verification of Protocols using Symbolic Execution, Comp. Networks No. 2, 1978
Budkowski S., Generation of a Global System Description from the Description of its Cooperating Subsystems, Proc. 4-th International Workshop on Protocol Specification, Testing and Verification, Skytop, Pennslvania, June 11–14, 1984
Budkowski S., Najm E., Structured Finite State Automata, Proc. IFIP WG.6.1 3-rd International Workshop on Protocol Specification, Testing and Verification, Ruschlikon, Switherland, 31 May - 2 June, 1983
Dannerberg R.B. and Ernst G.W., Formal Program Verification Using Symbolic Execution, IEEE Trans.on Soft. Eng., vol. SE-8,No. 1, January 1982
Hoare C.A.R.,Communicating Sequential Processes, Comm.of the ACM, vol. 21,No. 8, August 1978
Blikle A., Mazurkiewicz A., An algebraic approach to the theory of programs,languages and recursiveness, Proc. Int. Symp. and Summer School on Mathematical Fundation of Comp. Science, Warsaw-Jablonna, August 1972
MEB 83/ Merlin P., Bochman G.V, On the Construction of Submodule Specification and Communication Protocols, ACM Transaction on Programming Languages and Systems, Vol. 5, No. 1, Jan.1983, pp. 1–25
Milner R., A Calculus of Communicating Systems. Lecture Notes in Computer Science,No.92,Springer Verlag 1980
Prusinkiewicz P., Analysis of Cooperating Digital Units (in polish), Res. Rep. No. 16, Institute of Computer Science, Warsaw Technical University, Warsaw, 1980.
Rafiq O., Ansart J.P.,VADILOC: A protocol validator and its applications, Proc. IFIP WG 6.1 Third Int. Workshop on Protocol Specification, Testing and Verification May 31 - June 2, Ruschlikon, Switzerland 1983.
Rubin J., West C.H., An Improved Protocol Validation Technique, Computer Networks, Vol. 6, 1982.
Zafiropulo P., West C.H., Rudin H., Towards Analysis and Synthesizing Protocols, IEEE Trans. on Comm, Vol.COM-78, No. 4 April 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Budkowski, S. (1984). Modeling and Validating Broadcasting-Free Concurrent Systems. In: Großpietsch, KE., Dal Cin, M. (eds) Fehlertolerierende Rechensysteme. Informatik-Fachberichte, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69698-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-69698-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13348-3
Online ISBN: 978-3-642-69698-5
eBook Packages: Springer Book Archive