Abstract
Communication links are viewed as mathematical variables with additional logical operations relating the success of various references to the link, one to another. They may be described as having a tree structure, with arcs associated with success or failure, and nodes associated with the logical operations. Dynamic links are those which are created and manipulated explicitly as data objects, before being evaluated. Arcs as values may be transmitted via other links; thus an intermediate process can introduce two other processes to one another by giving them arcs of a link. The other processes may then „Eval” the arcs, in the Lisp sense, and communicate with one another directly. The behaviour of links is considered when time operations are available, both for defining sequences of events and for indicating relations that hold over intervals.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Abbreviations
- D.3.3:
-
Language Constructs Concurrent programming structures
- F.3.2:
-
Semantics of Programming Languages
References
H. Alexander, Formally-Based Tools and Techniques for Human-Computer Dialogues (Ellis Horwood Ltd., Chichester England, 1987).
J. A. Bergstra and J. W. Klop, Algebra of Communicating Processes with Abstraction, Report CS-R8403 (Dept. of Comp. Sci., Centre for Math. and Comp. Sci., Amsterdam, Jan. 1984).
R. L. Constable et al., Implementing Mathematics with the Nuprl Proof Development System (Prentice-Hall, Englewood Cliffs NJ, 1986).
S. Gregory, Parallel Logic Programming in Parlog (Addison-Wesley, Wokingham England, 1987).
R. E. Griswold, String and List Processing in Snobol 4 (Prentice-Hall, Englewood Cliffs NJ, 1975).
C. A. R. Hoare, Communicating Sequential Processes (Prentice-Hall, Englewood Cliffs NJ, 1985).
C. M. Holt, An Associative Constructive Logic, Tech. Report 250 (Comp. Lab., U. of Newcastle upon Tyne, Jan. 1988).
C. M. Holt, Concurrent Constructive Logic, Tech. Report 255 (Comp. Lab., U. of Newcastle upon Tyne, Apr. 1988).
B. Jayaraman, Semantics of EqL (IEEE Trans. Soft. Eng. 14 4, April 1988) 472–480.
P. Martin-Lof, Constructive Mathematics and Computer Programming, in: Meth. and Phil. of Sci. VI, Proc. of 6th Int. Cong. Hanover (North-Holland, Amsterdam, 1979).
R. Milner, A Calculus of Communicating Systems, Lecture Notes in Comp. Sci. 92 (Springer-Verlag, Berlin, 1980).
B. Nordstrom and J. Smith, Propositions and Specifications of Programs in Martin-Lofs Type Theory (BIT 24, 1984) 288–301.
M. J. O’Donnell, Equational Logic as a Programming Language (MIT Press, Cambridge MA, 1985).
D. Peleg, Concurrent Dynamic Logic (JACM 34 2, April 1987) 451–479.
A. Pnueli, The Temporal Logic of Programs, in: Proc. 18th IEEE Symp. on Found. of Comp. Sci. (IEEE, New York, 1977) 46–57.
F. Sadri, Three Recent Approaches to Temporal Reasoning, in: A. Galton, Ed., Temporal Logics and Their Applications (Academic Press, Orlando FL, 1987) 121–168.
E. Y. Shapiro, Systems Programming in Concurrent Prolog, in: Proc. 11th Symp. on Principles of Prog. Lang. (ACM, New York, 1984) 93–105.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag London
About this paper
Cite this paper
Holt, C.M. (1990). Dynamic Communication Links. In: Rattray, C. (eds) Specification and Verification of Concurrent Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3534-0_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3534-0_9
Publisher Name: Springer, London
Print ISBN: 978-3-540-19581-8
Online ISBN: 978-1-4471-3534-0
eBook Packages: Springer Book Archive