The following pages link to The mutual exclusion problem (Q5903449):
Displaying 35 items.
- Modeling concurrency with interval traces (Q515576) (← links)
- The computability of relaxed data structures: queues and stacks as examples (Q518927) (← links)
- Elucidating concurrent algorithms via layers of abstraction and reification (Q539423) (← links)
- Structure of concurrency (Q685384) (← links)
- Correctness and concurrent complexity of the black-white bakery algorithm (Q736464) (← links)
- Nonatomic dual bakery algorithm with bounded tokens (Q766163) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms (Q897371) (← links)
- The processor identity problem (Q917266) (← links)
- Relational structures model of concurrency (Q934912) (← links)
- Distributed match-making (Q1107317) (← links)
- The equational theory of pomsets (Q1119012) (← links)
- Functional specification and proof of correctness for time dependent behaviour of reactive systems (Q1176111) (← links)
- Bounded time-stamps (Q1261108) (← links)
- On the mutual-exclusion problem -- a quest for minimal solutions (Q1329738) (← links)
- Two implementation relations and the correctness of communicating replicated processes (Q1362771) (← links)
- The entropy of a distributed computation random number generation from memory interleaving (Q1656885) (← links)
- Tournaments for mutual exclusion: verification and concurrent complexity (Q1682286) (← links)
- Interval semantics for Petri nets with inhibitor arcs (Q1749475) (← links)
- Lattice structure of temporal interval relations (Q1910463) (← links)
- Relational structures for concurrent behaviours (Q1998872) (← links)
- Recoverable mutual exclusion (Q2010612) (← links)
- A visit to mutual exclusion in seven dates (Q2136281) (← links)
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos (Q2377304) (← links)
- Classifying invariant structures of step traces (Q2424691) (← links)
- A Concurrent Implementation of Skip Graphs (Q2840547) (← links)
- On Interval Process Semantics of Petri Nets with Inhibitor Arcs (Q2941144) (← links)
- Non-atomic Transition Firing in Contextual Nets (Q2941146) (← links)
- The Arthur Prior memorial conference, Christchurch, 1989 (Q3352992) (← links)
- Languages of higher-dimensional automata (Q5076390) (← links)
- Generating Posets Beyond N (Q5098715) (← links)
- Linearizable counting networks (Q5137016) (← links)
- Shared-memory mutual exclusion: major research trends since 1986 (Q5138486) (← links)
- Step traces (Q5963403) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
