Abstract
In this paper we present a multiprocessor semantics for CCS [Mil80]. An operational semantics for processes under a finite number of processors is developed. The effect of adding or removing processors from the system is studied. A notion of strong bisimulation induced by the new semantics is defined. Issues related to a complete axiomatization of this congruence are examined and a complete equational system for a subset of CCS is presented.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
G. Berry and G. Boudol. The Chemical Abstract Machine. Technical Report 1133, INRIA-Sophia Antipolis, December 1989.
G. Boudol and I. Castellani. On Semantics of Concurrency: Partial Orders and Transition Systems. In Proceedings of the Internation Joint Conference on TAPSOFT: LNCS 249. Springer Verlag, 1987.
J. P. Banatre, A. Coutant, and D. Metayer. A Parallel Machine for Multiset Transformation and its Programming Style. Future Generation Computer Systems, 4:133–144, 1988.
I. Castellani and M. Hennessy. Distributed Bisimulations. Journal of the Association for Computing Machinery, 36(4):887–911, October 1989.
P. Degano, R. DeNicola, and U. Montanari. A Distributed Operational Semantics for CCS Based on Condition/Event Systems. Acta Informatica, 26:59–91, 1988.
A. Jones and P. Schwarz. Experience using multiprocessor systems — A status report. ACM Computing Surveys, 12(2), 1980.
A. Kiehn, M. Hennessy, I. Castellani, and G. Boudol. Observing localities. In Mathematical Foundations of Computer Science(MFCS), 1991.
P. Krishnan. Distributed CCS. In Theories of Concurrency: Unification and Extension: CONCUR-91, LNCS:527, August 1991.
R. Milner. A Calculus of Communicating Systems. Lecture Notes on Computer Science Vol. 92. Springer Verlag, 1980.
R. Milner. Calculus for Synchrony and Asynchrony. Theoretical Computer Science, 25:267–310, 1983.
D. Park. Concurrency and Automata on Infinite Sequences. In Proceedings of the 5th GI Conference, LNCS-104. Springer Verlag, 1981.
G. D. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
V. Pratt. Modelling Concurrency with Partial Orders. International Journal of Parallel Programming, 15(1), 1986.
A. Salwicki and T. Muldner. On the Algorithmic Properties of Concurrent Programs. In LNCS-125. Springer Verlag, 1982.
R. J. van Glabbeek and F. W. Vaandrager. Petri Net Models for Algebraic Theories of Concurrency. In J. W. deBakker, A. J. Nijman, and P. C. Treleaven, editors, PARLE-II, LNCS 259. Springer Verlag, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishnan, P. (1992). A semantics for multiprocessor systems. In: Krieg-Brückner, B. (eds) ESOP '92. ESOP 1992. Lecture Notes in Computer Science, vol 582. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55253-7_18
Download citation
DOI: https://doi.org/10.1007/3-540-55253-7_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55253-6
Online ISBN: 978-3-540-46803-5
eBook Packages: Springer Book Archive