A. General, In the case of (n, k)-set agreement, the alternation number is a lower bound on the minimum number of opinions. On the other hand, [12] shows that any language with opinion number ? can be monitored with O(?) opinions. It would be interesting to generalize the lower bound to other languages or to find a language that can be monitored with strictly fewer opinions than its alternation number

Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt et al., Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993.
DOI : 10.1145/153724.153741

H. Attiya and S. Rajsbaum, The Combinatorial Structure of Wait-Free Solvable Tasks, SIAM Journal on Computing, vol.31, issue.4, pp.1286-1313, 2002.
DOI : 10.1137/S0097539797330689

B. Awerbuch, B. Patt-shamir, and G. Varghese, Self-stabilization by local checking and correction, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.268-277, 1991.
DOI : 10.1109/SFCS.1991.185378

A. Bauer and Y. Falcone, Decentralised LTL monitoring. Formal Methods, lncs #7436, pp.85-100, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00857286

A. Bauer, M. Leucker, and C. Schallhart, Comparing LTL Semantics for Runtime Verification, Journal of Logic and Computation, vol.20, issue.3, pp.651-674, 2010.
DOI : 10.1093/logcom/exn075

S. Berkovich, B. Bonakdarpour, and S. Fischmeister, GPU-based Runtime Verification, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pp.1025-1036, 2013.
DOI : 10.1109/IPDPS.2013.105

M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, vol.3, issue.1, pp.63-75, 1985.
DOI : 10.1145/214451.214456

S. Chaudhuri, More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993.
DOI : 10.1006/inco.1993.1043

M. Fischer, N. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/3149.214121

P. Fraigniaud, A. Korman, and D. Peleg, Local Distributed Decision, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.708-717, 2011.
DOI : 10.1109/FOCS.2011.17
URL : https://hal.archives-ouvertes.fr/hal-00912561

P. Fraigniaud, S. Rajsbaum, and T. C. , Locality and Checkability in Wait-Free Computing, Distributed Computing, vol.15, issue.4, pp.223-242, 2013.
DOI : 10.1007/BF01961540
URL : https://hal.archives-ouvertes.fr/hal-00992781

P. Fraigniaud, S. Rajsbaum, and T. C. , On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems, 14th International Conference on Runtime Verification (RV), lncs #8734, pp.92-107, 2014.
DOI : 10.1007/978-3-319-11164-3_9
URL : https://hal.archives-ouvertes.fr/hal-01102121

M. Henle, A Combinatorial Introduction to Topology, 1994.

M. Herlihy, D. Kozlov, and R. S. , Distributed Computing Through Combinatorial Topology, 2013.

M. Herlihy and N. Shavit, The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999.
DOI : 10.1145/331524.331529

M. Raynal, Concurrent Programming -Algorithms, Principles, and Foundations, 2013.
DOI : 10.1007/978-3-642-32027-9
URL : https://hal.archives-ouvertes.fr/hal-00922217

K. Sen, A. Vardhan, G. Agha, and R. G. , Decentralized runtime analysis of multithreaded applications, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006.
DOI : 10.1109/IPDPS.2006.1639591