Abstract
New operators are introduced on top of ACP [BK 84] in order to incorporate stable signals in process algebra. Semantically this involves assigning labels to nodes of process graphs. The labels of nodes are called signals. In combination with the operators of BPA, a signal insertion operator allows to describe each finite tree labeled with actions and signals, provided the signals do not occur at leaves of the tree. In a merge processes can observe the signals of concurrent processes. This research was sponsored in part by ESPRIT under contract 432, METEOR.
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
J.C.M.Baeten & J.A.Bergstra, Global renaming operators in concrete process algebra, Report P8709, University of Amsterdam, Programming Research Group (1987), to appear in Information and Computation
J.A.Bergstra, Process algebra for synchronous communication and observation, University of Amsterdam, Programming Research Group, Report P88XX, (1988)
J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Information and Control 60 (1/3), (1984) 109–137
G.Berry, P.Couronne, & G.Gonthier, Synchronous programming of reactive systems: an introduction to ESTEREL, in Proc.first France-Japan Symposium on Artificial Intelligence and Computer Science, Tokyo, North-Holland, (1986)
(Ed. E. Brinksma) Information Processing Systems-Open Systems Interconnection-LOTOS-A formal description technique based on the temporal ordering of observational behavior, ISO/TC 97/SC 21/20-7-1987
R. van Glabbeek, Bounded nondeterminism and the approximation induction principle in process algebra, in: proc. STACKS 87 (Eds. F.J.Brandenburg, G.Vidal-Naquet & M.Wirsing) LNCS 247 Springer (1987) 336–347
S.Mauw & G.J.Veltink, A process specification formalism, University of Amsterdam, Programming Research Group, Report XXX (1988)
R.Milner, A Calculus of Communicating Systems, Springer LNCS, (1980)
M.Jackson, System development, Prentice Hall, (1983)
F.W. Vaandrager, Process algebra semantics for POOL, Report CS-R8629, Centre for Mathematics and Computer Science, Amsterdam (1986)
J.L.M. Vrancken, The algebra of communicating processes with empty process, Report FVI 86-01, Programming Research Group, University of Amsterdam, (1986)
R.J.Wieringa, Jackson system development analysed in process algebra, Report IR-148, Free University, Amsterdam, Department of Mathematics and Computer Science, (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Akademie-Verlag Berlin
About this paper
Cite this paper
Bergstra, J.A. (1988). ACP with signals. In: Grabowski, J., Lescanne, P., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1988. Lecture Notes in Computer Science, vol 343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50667-5_53
Download citation
DOI: https://doi.org/10.1007/3-540-50667-5_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50667-6
Online ISBN: 978-3-540-46063-3
eBook Packages: Springer Book Archive