Advertisement

ACP with signals

  • J. A. Bergstra
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 343)

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.

Keywords

Axiom System Communication Function Atomic Action Process Algebra Signal Observation 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BB 87]
    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 ComputationGoogle Scholar
  2. [B 88]
    J.A.Bergstra, Process algebra for synchronous communication and observation, University of Amsterdam, Programming Research Group, Report P88XX, (1988)Google Scholar
  3. [BK 84]
    J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Information and Control 60 (1/3), (1984) 109–137MathSciNetCrossRefzbMATHGoogle Scholar
  4. [BCC 86]
    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)Google Scholar
  5. [Br 87]
    (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-1987Google Scholar
  6. [vGl 87]
    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–347MathSciNetzbMATHGoogle Scholar
  7. [MV 88]
    S.Mauw & G.J.Veltink, A process specification formalism, University of Amsterdam, Programming Research Group, Report XXX (1988)Google Scholar
  8. [Mi 80]
    R.Milner, A Calculus of Communicating Systems, Springer LNCS, (1980)Google Scholar
  9. [Ja 83]
    M.Jackson, System development, Prentice Hall, (1983)Google Scholar
  10. [Va 86]
    F.W. Vaandrager, Process algebra semantics for POOL, Report CS-R8629, Centre for Mathematics and Computer Science, Amsterdam (1986)Google Scholar
  11. [Vr 86]
    J.L.M. Vrancken, The algebra of communicating processes with empty process, Report FVI 86-01, Programming Research Group, University of Amsterdam, (1986)Google Scholar
  12. [W 88]
    R.J.Wieringa, Jackson system development analysed in process algebra, Report IR-148, Free University, Amsterdam, Department of Mathematics and Computer Science, (1988)Google Scholar

Copyright information

© Akademie-Verlag Berlin 1988

Authors and Affiliations

  • J. A. Bergstra
    • 1
    • 2
  1. 1.Programming Research GroupUniversity of AmsterdamThe Netherlands
  2. 2.Department of PhilosophyState University of UtrechtThe Netherlands

Personalised recommendations