Abstract
The specification and implementation of a class of concurrent systems is investigated in this paper using PARLOG as the implementation language, guided by specifications in CCS. This class of systems is restricted to an illustrative subset, including buffers and queues. A comparison is made between the computational models of concurrency that are expressed by each language. Illustrative programs are given which highlight the differences in operational behaviour between programs in the two languages. We investigate the ways in which equivalences in CCS programs may be used to compare PARLOG programs, and the areas of PARLOG programming which are not covered by this comparison. The advantages and disadvantages of CCS compared with PARLOG as a ‘specification-implementation’ language are discussed.
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
Mark R. Ellis, “A Relational Language into ECCS,” M.Sc, Imperial College of Science & Technology, London. UK, 12th September 1986.
David Gilbert, “PARLOG: a tutorial introduction.,” Proceedings of Parallel Processing and Supercomputing, Begian Institute for Automatic Control, Antwerp, Belgium, November 19–20, 1987.
David Gilbert, “Executable LOTOS: Using PARLOG to implement an FDT,” Proceedings of IFIP Protocol Specification, Testing and Verification: VII, Zurich, Switzerland, 5–8 May 1987, Elsevier Science, North-Holland, Amsterdam, Netherlands, 1987.
David A. Giles, “The Theory of LISTS in LCF,” CSR-31–78, Department of Computer Science, University of Edinburgh, Edinburgh, 1978.
Steve Gregory, Parallel Logic Programming in PARLOG: The Language and its Implementation, Addison-Wesely, London, UK, 1987.
Charlie Hussey, “Interpreting PARLOG Programs as CCS agents,” Report for MSc degree in Engineering, Imperial College of Science and Technology, London, September 1987.
Robin Milner, “Process Constructors and Interpretations,” Proceedings of IFIP 10th International World Computer Congress, vol. 10, pp. 507–514, North Holland, Dublin, Ireland, September 1–5, 1986.
Ehud Shapiro and Akikazu Takeuchi, “Object Oriented Programming in Concurrent Prolog,” CS83–08, Department of Applied Mathematics, Weizmann Institute of Sciences, Rehovot, Israel, June 1983.
E. Shapiro and C. Mierowsky, “Fair, Biased, and Self-Balancing Merge Operators: Their Specification and Implementation in Concurrent Prolog,” CS84–07, Weizmann Institute, Rehovot, Israel, 1984.
Akikazu Takeuchi and Koichi Furukawa, “Bounded Buffer Communication in Concurrent Prolog,” in Concurrent Prolog, ed. Ehud Shapiro, vol. 1, pp. 464–475, MIT Press, 1987.
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
Gilbert, D. (1990). Specification and implementation of concurrent systems using PARLOG. 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_23
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3534-0_23
Publisher Name: Springer, London
Print ISBN: 978-3-540-19581-8
Online ISBN: 978-1-4471-3534-0
eBook Packages: Springer Book Archive