论文信息 - Critical Remarks on MAX Model of Concurrency

Critical Remarks on MAX Model of Concurrency

A few critical remarks on a mathematical model of concurrency are discussed. As the result we were able to improve the model, to state new problems to be studied later on and to remark that the ideas of our model can be applied to the tasking of ADA, CSP and CCS. It means that apart of standard semantics of ADA there is another one and it is not obvious which semantics is more natural.

Andrzej Salwicki | A. Salwicki

[1] Yat-Sang Kwong. On the Absence of Livelocks in Parallel Programs , 1979, Semantics of Concurrent Computation.

[2] Tomasz Müldner. On Properties of Certain Synchronizing Tool for Parallel Computations , 1977, FCT.

[3] Paul G. Spirakis,et al. Distributed algorithms for synchronizing interprocess communication within real time , 1981, STOC '81.

[4] Andrzej Salwicki. Applied Algorithmic Logic , 1977, MFCS.

[5] Nancy A. Lynch,et al. A difference in efficiency between synchronous and asynchronous systems , 1981, STOC '81.

[6] Nancy A. Lynch,et al. On Describing the Behavior and Implementation of Distributed Systems , 1979, Theor. Comput. Sci..

[7] Grazyna Mirkowska,et al. Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations , 1980, STOC '80.

[8] Leslie Lamport,et al. "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.

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

[10] Grazyna Mirkowska,et al. Algorithmic logic with nondeterministic programs , 1980, Fundam. Informaticae.

[11] Grazyna Mirkowska. Model existence theorems in algorithmic logic with non-deterministic programs , 1980, Fundam. Informaticae.