论文信息 - A Semantics for Multiprocessor Systems

A Semantics for Multiprocessor Systems

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.

Padmanabhan Krishnan

[1] Matthew Hennessy,et al. Distributed bisimulations , 1989, JACM.

[2] Journal of the Association for Computing Machinery , 1961, Nature.

[3] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[4] Padmanabhan Krishnan,et al. Distributed CCS , 1991, CONCUR.

[5] Tomasz Müldner,et al. On the Algorithmic Properties of Concurrent Programs , 1979, Logic of Programs.

[6] Rob J. van Glabbeek,et al. Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[7] Matthew Hennessy,et al. Observing Localities , 1993, Theor. Comput. Sci..

[8] Peter M. Schwarz,et al. Experience Using Multiprocessor Systems—A Status Report , 1980, CSUR.

[9] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[10] Gérard Berry,et al. The chemical abstract machine , 1989, POPL '90.

[11] Daniel Le Métayer,et al. A parallel machine for multiset transformation and its programming style , 1988, Future Gener. Comput. Syst..

[12] Ilaria Castellani,et al. On the Semantics of Concurrency: Partial Orders and Transition Systems , 1987, TAPSOFT, Vol.1.

[13] Robin Milner,et al. Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..