True Concurrency = Interleaving Concurrency + Weak Conflict
Leila Ribeiro Korff, Martin Korff · Electronic Notes in Theoretical Computer Science · 1998
In this paper we show that true concurrency is not the same as interleaving concurrency for systems that allow read-access. More precisely, whenever two actions are interleavingly concurrent they are also truly concurrent, but the converse is not always true due to a phenomena that we call weak conflict, that allows the possibility of one writer to act in parallel with one (or many) readers.