M. Abadi and M. Isard, On the Flow of Data, Information, and Time, Proceedings of the 4th Conference on Principles of Security and Trust, 2015.
DOI : 10.1007/978-3-662-46666-7_5

M. Abadi and M. Isard, Timely Rollback: Specification and Verification, Proceedings of the 7th NASA Formal Methods Symposium, 2015.
DOI : 10.1007/978-3-319-17524-9_3

M. Abadi and L. Lamport, The existence of refinement mappings, Theoretical Computer Science, vol.82, issue.2, pp.253-284, 1991.
DOI : 10.1016/0304-3975(91)90224-P

M. Abadi, F. Mcsherry, D. G. Murray, and T. L. Rodeheffer, Formal Analysis of a Distributed Algorithm for Tracking Progress, Formal Techniques for Distributed Systems -Joint IFIP WG 6.1 International Conference, pp.5-19, 2013.
DOI : 10.1007/978-3-642-38592-6_2
URL : https://hal.archives-ouvertes.fr/hal-01515239

G. E. Blelloch, Programming parallel algorithms, Communications of the ACM, vol.39, issue.3, pp.85-97, 1996.
DOI : 10.1145/227234.227246

T. T. Hildebrandt, P. Panangaden, and G. Winskel, A relational model of non-deterministic dataflow, Mathematical Structures in Computer Science, vol.14, issue.5, pp.613-649, 2004.
DOI : 10.1017/S0960129504004293

D. R. Jefferson, Virtual time, ACM Transactions on Programming Languages and Systems, vol.7, issue.3, pp.404-425, 1985.
DOI : 10.1145/3916.3988

M. John, C. Lhoussaine, J. Niehren, and A. M. Uhrmacher, The Attributed Pi-Calculus with Priorities, Transactions on Computational Systems Biology, vol.325, issue.3, pp.13-76, 2010.
DOI : 10.1016/j.tcs.2004.03.065
URL : https://hal.archives-ouvertes.fr/inria-00422969

B. Jonsson, A fully abstract trace model for dataflow and asynchronous networks, Distributed Computing, vol.32, issue.2, pp.197-212, 1994.
DOI : 10.1007/3-540-15670-4_9

G. Kahn, The semantics of a simple language for parallel programming, pp.471-475, 1974.

L. Lamport, Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers, 2002.

D. G. Murray, F. Mcsherry, R. Isaacs, M. Isard, P. Barham et al., Naiad, Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP '13, pp.439-455, 2013.
DOI : 10.1145/2517349.2522738

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

P. Selinger, First-order axioms for asynchrony, CONCUR '97: Concurrency Theory, 8th International Conference, pp.376-390, 1997.
DOI : 10.1007/3-540-63141-0_26

C. Versari, N. Busi, and R. Gorrieri, An expressiveness study of priority in process calculi, Mathematical Structures in Computer Science, vol.4703, issue.06, pp.1161-1189, 2009.
DOI : 10.1007/978-3-540-74407-8_17