Additional comments on a problem in concurrent programming control

@article{Bruijn1967AdditionalCO,
  title={Additional comments on a problem in concurrent programming control},
  author={N. D. Bruijn},
  journal={Commun. ACM},
  year={1967},
  volume={10},
  pages={137-138}
}

Topics from this paper

Understanding Control Flow
  • P. Buhr
  • Computer Science
  • Springer International Publishing
  • 2016
class, 380 abstraction, 28 accept-blocked, 281, 337 accepting daisy-chain,289 multiple,289 acceptor stack, 270 acceptor/signalled stack, 275, 281, 282, 339 Achermann, Wilhelm, 22 acquire, 190, 193Expand
The Temporal Logic of Reactive and Concurrent Systems
TLDR
This volume offers an introduction to temporal logic and to the computational model for reactive programs which has been developed by the authors. Expand
Invisible invariants in the spotlight Verifiable proofs for parameterized systems
We study the problem of automatically proving parameterized mutual exclusion algorithms mutually exclusive. In our first contribution we show that the problem remains undecidable even for a very weakExpand
1 Value-centric Dynamic Partial Order Reduction
The verification of concurrent programs remains an open challenge, as thread interaction has to be accounted for, which leads to state-space explosion. Stateless model checking battles this problemExpand
Value-centric dynamic partial order reduction
TLDR
An algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning using polynomial time per class, and shows that value-happens-before is always at least as coarse as the happens-before equivalence, and can be even exponentially coarser. Expand
Distributed Systems
TLDR
The new version of this text adds even more relevant and cutting-edge topics in the field while continuing the excellent coverage of the fundamentals. Expand
Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution
TLDR
This work traces the history of concurrency, from early ideas based on mutual exclusion, passing through consensus and concurrent objects, until today ledgers and blockchains, and discusses on the limits that this approach encounters. Expand
Petri Net Model for Ricart and Agrawala’s Mutual Exclusion Algorithm
TLDR
A Ricart and Agrawala mutual exclusion algorithm is investigated and simulation model of the system based on Petri Nets is described, and results are presented and evaluated. Expand
An Approach to Process Management using Process Synchronization
TLDR
The main goal of the study is to know how multiple processes of a computer system is managed, and whether CPU is synchronized by synchronization of processes. Expand
High‐performance N‐thread software solutions for mutual exclusion
Software solutions for mutual exclusion developed over a 30‐year period, starting with complex ad hoc algorithms and progressing to simpler formal ones. While it is easy to dismiss software solutionsExpand
...
1
2
3
4
5
...