Abstract
In this paper we propose a process algebra named CCB (a Calculus of Countable Broadcasting Systems). We define an observational congruence relation in CCB after basic definitions of CCB, and give a sound and complete axiom system for the congruence relation of finite agents.
CCB is developed for analyzing a multi-agent model with broadcast communication. The most important property of CCB is that a broadcaster of a message can know the number of receivers of the message after broadcasting. The property is not easily described in the other process algebras.
The multi-agent model is useful for constructing extensible systems. A disadvantage of the multi-agent model is that agents must be designed very carefully because unexpected behavior may arise by interactions between the agents. Therefore we want to analyze behavior of the agents.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.Coutaz, “Architecture Model for Interactive Software: Failures and Trends”, Proc. of the IFIP TC 2/WG 2.7 Working Conference on Engineering for Human-Computer Interaction, pp.137–153, 1989.
R.Milner, “Communication and Concurrency”, Prentice-Hall, 1989.
R.Milner, J.Parrow and D.Walker, “A Calculus of Mobile Processes, I and II”, Information and Computation, 100, pp.1–40 and pp.41–77, 1992.
R.Milner, “Calculi for Synchrony and Asynchrony”, Journal of Theoretical Computer Science, Vol.25, pp.267–310, 1983.
R.de Simone, “Higher-level Synchronizing Devices in Meije-SCCS”, Journal of Theoretical Computer Science, Vol.37, pp.245–267, 1985.
C.A.R.Hoare,”Communicating Sequential Processes”, Prentice-Hall, 1985.
K.V.S.Prasad, “A Calculus of Broadcasting Systems”, TAPSOFT'91, Vol.l:CAAP, LNCS 493, Springer-Verlag, pp.338–358, 1991
K.V.S.Prasad, “A Calculus of Value Broadcasts”, PARLE'93, LNCS 694, Springer-Verlag, pp.391–402, 1993
Uno Holmer, “Interpreting Broadcast Communication in SCCS”, CONCUR'93, LNCS 715, Springer-Verlag, pp.188–201, 1993
F.Moller and C.Tofts,”An overview of TCCS”, Proc. of EUROMICRO'92, Athens, June 1992.
L.Aceto, B.Bloom, and F.Vaandrager “Turning SOS Rules into Equations”, Proc. 7th Annual IEEE Symposium on Logic in Computer Science, pp.113–124, 1988.
G.Winskel, “Synchronization trees”, Journal of Theoretical Computer Science, Vol.34, pp.33–82, 1984.
Y.Sato and K.Ohmaki “A Flexible Inter-Agent Connection Scheme for Interactive Software”, IPSJ Technical Report, SE89-7, pp.49–56, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Isobe, Y., Sato, Y., Ohmaki, K. (1995). A Calculus of Countable Broadcasting Systems. In: Alagar, V.S., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1995. Lecture Notes in Computer Science, vol 936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60043-4_73
Download citation
DOI: https://doi.org/10.1007/3-540-60043-4_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60043-5
Online ISBN: 978-3-540-49410-2
eBook Packages: Springer Book Archive