A. Bossi, C. Piazza, and S. Rossi, Modelling downgrading in information flow security, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004., p.187, 2004.
DOI : 10.1109/CSFW.2004.1310741
URL : http://www.dsi.unive.it/%7Esrossi/Papers/csfw04.pdf

N. Broberg and D. Sands, Paralocks: role-based information flow control and beyond, Proceedings of POPL 2010, pp.431-444, 2010.

N. Busi and R. Gorrieri, Structural non-interference in elementary and trace nets, Mathematical Structures in Computer Science, vol.1491, issue.06, pp.1065-1090, 2009.
DOI : 10.1007/3-540-65306-6_14

M. R. Clarkson, B. Finkbeiner, M. Koleini, K. K. Micinski, M. N. Rabe et al., Temporal Logics for Hyperproperties, Proceedings of POST 2014, pp.265-284, 2014.
DOI : 10.1007/978-3-642-54792-8_15

M. R. Clarkson and F. B. Schneider, Hyperproperties, Journal of Computer Security, vol.18, issue.6, pp.1157-1210, 2010.
DOI : 10.3233/JCS-2009-0393

R. Focardi and R. Gorrieri, A Classification of Security Properties for Process Algebras1, Journal of Computer Security, vol.3, issue.1, pp.5-34, 1995.
DOI : 10.3233/JCS-1994/1995-3103

R. Focardi and R. Gorrieri, Classification of security properties (part I: information flow), Proceedings of FOSAD 2000, pp.331-396, 2000.

E. Fujisaki and T. Okamoto, How to Enhance the Security of Public-Key Encryption at Minimum Cost, Proceedings of PKC 1999, pp.53-68, 1999.
DOI : 10.1007/3-540-49162-7_5

R. Gorrieri and M. Vernali, On Intransitive Non-interference in Some Models of Concurrency, Proceedings of FOSAD 2010, pp.125-151, 2011.
DOI : 10.1109/CSFW.1999.779775

F. Leitner-fischer and S. Leue, Probabilistic fault tree synthesis using causality computation, International Journal of Critical Computer-Based Systems, vol.4, issue.2, pp.119-143, 2013.
DOI : 10.1504/IJCCBS.2013.056492

X. Li, F. Nielson, H. R. Nielson, and X. Feng, Disjunctive Information Flow for Communicating Processes, Proceedings of TGC 2015, pp.95-111, 2015.
DOI : 10.1007/978-3-319-28766-9_7

P. Madhusudan, Model-checking trace event structures, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.371-380, 2003.
DOI : 10.1109/LICS.2003.1210077
URL : http://www-faculty.cs.uiuc.edu/~madhu/lics03.ps

H. Mantel and D. Sands, Controlled Declassification Based on Intransitive Noninterference, Proceedings of APLAS 2004, pp.129-145, 2004.
DOI : 10.1109/CSFW.2001.930133

R. C. Merkle, Secure communications over insecure channels, Communications of the ACM, vol.21, issue.4, pp.294-299, 1978.
DOI : 10.1145/359460.359473
URL : http://www.merkle.com/1974/PuzzlesAsPublished.pdf

D. Milushev and D. Clarke, Towards Incrementalization of Holistic Hyperproperties, Proceedings of POST 2012, pp.329-348, 2012.
DOI : 10.1007/978-3-642-28641-4_18

M. Nielsen, G. D. Plotkin, and G. Winskel, Petri nets, event structures and domains, Proceedings of the International Symposium on the Semantics of Concurrent Computation, pp.266-284, 1979.
DOI : 10.1007/BFb0022474

T. Okamoto and K. Ohta, How to simultaneously exchange secrets by general assumptions, Proceedings of the 2nd ACM Conference on Computer and communications security , CCS '94, pp.184-192, 1994.
DOI : 10.1145/191177.191221

J. Rushby, Noninterference, transitivity, and channel-control security policies, 1992.

J. Rushby, Separation and integration in MILS (the MILS constitution), 2008.

A. Sabelfeld and A. C. Myers, Language-based information-flow security, IEEE Journal on Selected Areas in Communications, vol.21, issue.1, pp.5-19, 2003.
DOI : 10.1109/JSAC.2002.806121

A. Sabelfeld and D. Sands, Declassification: Dimensions and principles, Journal of Computer Security, vol.17, issue.5, pp.517-548, 2009.
DOI : 10.3233/JCS-2009-0352
URL : http://www.md.chalmers.se/~andrei/sabelfeld-sands-jcs07.pdf

P. Thiagarajan, Regular Trace Event Structures, BRICS Report Series, vol.3, issue.32, 1996.
DOI : 10.7146/brics.v3i32.20012
URL : http://www.brics.dk/RS/96/Ref/BRICS-RS-96-Ref/../../../../RS/96/32/BRICS-RS-96-32.ps.gz

P. S. Thiagarajan, Regular Event Structures and Finite Petri Nets: A Conjecture, Formal and Natural Computing, pp.244-256, 2002.
DOI : 10.1007/3-540-45711-9_14