C. A. Hoare, B. Oller, G. Struth, and I. Wehrman, Concurrent Kleene Algebra and its Foundations, The Journal of Logic and Algebraic Programming, vol.80, issue.6, pp.266-296, 2011.
DOI : 10.1016/j.jlap.2011.04.005
URL : https://doi.org/10.1016/j.jlap.2011.04.005

T. Hoare and S. Van-staden, The laws of programming unify process calculi, Science of Computer Programming, vol.85, pp.102-114, 2014.
DOI : 10.1016/j.scico.2013.08.012

T. Hoare and S. Van-staden, In praise of algebra, Formal Aspects of Computing, vol.109, issue.17, pp.423-431, 2012.
DOI : 10.1016/j.ipl.2009.06.003

T. Hoare, S. Van-staden, B. Oller, G. Struth, J. Villard et al., Developments in Concurrent Kleene Algebra, pp.14-15, 2014.
DOI : 10.1007/978-3-319-06251-8_1

V. Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming, vol.25, issue.49, pp.33-71, 1986.
DOI : 10.1007/BF01379149

J. L. Gischer, The equational theory of pomsets, Theoretical Computer Science, vol.61, issue.2-3, pp.199-224, 1988.
DOI : 10.1016/0304-3975(88)90124-7

C. A. Petri, Communication with automata, 1966.

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

J. Grabowski, On partial languages, Fundam. Inform, vol.4, issue.2, pp.427-498, 1981.

M. Nielsen, G. D. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, issue.1, pp.85-108, 1981.
DOI : 10.1016/0304-3975(81)90112-2

B. Bloom and M. Z. Kwiatkowska, Trade-offs in true concurrency: Pomsets and mazurkiewicz traces, MFPS '91, pp.350-375, 1992.
DOI : 10.1007/3-540-55511-0_18

J. Feigenbaum, J. Kahn, and C. Lund, Complexity Results for POMSET Languages, SIAM Journal on Discrete Mathematics, vol.6, issue.3, pp.432-442, 1993.
DOI : 10.1137/0406035

M. R. Laurence and G. Struth, Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages, RAMiCS ', pp.14-65, 2014.
DOI : 10.1007/978-3-319-06251-8_5

P. Sewell, S. Sarkar, S. Owens, F. Z. Nardelli, and M. O. Myreen, A rigorous and usable programmer's model for x86 multiprocessors, Commun. ACM, vol.53, issue.7, pp.86-89, 2010.

?. Sev?ík, J. Vafeiadis, V. Zappa-nardelli, F. Jagannathan, S. Sewell et al., Relaxed-memory concurrency and verified compilation, ACM SIGPLAN Notices, vol.46, issue.1, pp.43-54, 2011.
DOI : 10.1145/1925844.1926393

M. Batty, S. Owens, S. Sarkar, P. Sewell, and T. Weber, Mathematizing C++ concurrency, ACM SIGPLAN Notices, vol.46, issue.1, pp.55-66, 2011.
DOI : 10.1145/1925844.1926394

J. Alglave, L. Maranget, S. Sarkar, and P. Sewell, Fences in weak memory models (extended version), Formal Methods in System Design, vol.10, issue.2, pp.170-205, 2012.
DOI : 10.1145/42190.42277
URL : https://hal.archives-ouvertes.fr/hal-01100778

J. Alglave, D. Kroening, and M. Tautschnig, Partial Orders for Efficient Bounded Model Checking of??Concurrent??Software, pp.141-157, 2013.
DOI : 10.1007/978-3-642-39799-8_9

´. Esik and Z. , Axiomatizing the subsumption and subword preorders on finite and infinite partial words, Theoretical Computer Science, vol.273, issue.1-2, pp.225-248, 2002.
DOI : 10.1016/S0304-3975(00)00442-4

J. Alglave, L. Maranget, S. Sarkar, and P. Sewell, Litmus: Running Tests against Hardware, pp.41-44, 2011.
DOI : 10.1145/1785414.1785443
URL : https://hal.archives-ouvertes.fr/hal-01100851

A. Horn and J. Alglave, Concurrent Kleene algebra of partial strings. ArXiv e-prints abs/1407, p.385, 2014.

J. W. De-bakker and J. H. Warmerdam, Metric pomset semantics for a concurrent language with recursion, Proceedings of the LITP Spring School on Theoretical Computer Science on Semantics of Systems of Concurrent Processes, pp.21-49, 1990.
DOI : 10.1007/3-540-53479-2_2

L. Lamport, How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs, IEEE Transactions on Computers, vol.28, issue.9, pp.690-691, 1979.
DOI : 10.1109/TC.1979.1675439

K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta et al., Memory consistency and event ordering in scalable shared-memory multiprocessors, ACM SIGARCH Computer Architecture News, vol.18, issue.3, pp.15-26, 1990.
DOI : 10.1145/325096.325102