Interference between communicating parallel processes
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On synchronization primitive systems
On synchronization primitive systems
Renamings, Maximal Parallelism, and Space-Time Tradeoff in Program Schemata
Journal of the ACM (JACM)
Time-space trade-offs for asynchronous parallel models (Reducibilities and Equivalences)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
When studying parallel computation and synchronization one is faced with the problem of modeling the simultaneous execution of processes. Although there has been a multitude of formal means for representing such problems [2, 6, 9, 10, 13, 14, 15], invariably, when all the other complexities of the models have been stripped away, the parallelism or synchronization is studied via sequences of events. In all of these studies simultaneity of events is not studied directly. Rather, it is represented by the interleaving of the separate events into sequences, and by studying properties of the set of all such sequences.