I. Aktug and K. , ConSpec ??? A Formal Language for Policy Specification, Electronic Notes in Theoretical Computer Science, vol.197, issue.1, pp.45-58, 2008.
DOI : 10.1016/j.entcs.2007.10.013

H. R. Andersen, Verification of Temporal Properties of Concurrent Systems, DAIMI Report Series, vol.22, issue.445, 1993.
DOI : 10.7146/dpb.v22i445.6762

H. R. Andersen, Partial model checking (extended abstract), Proceedings of 10th Annual IEEE Symposium on Logic in Computer Science, pp.398-407, 1995.

A. Arnold, A. Vincent, and I. Walukiewicz, Games for synthesis of controllers with partial observation, Theoretical Computer Science, vol.303, issue.1, pp.7-34, 2003.
DOI : 10.1016/S0304-3975(02)00442-5

E. Asarin and C. Dima, Balanced timed regular expressions1 1Partially supported by the European community project IST-2001-35304 AMETIST, Electronic Notes in Theoretical Computer Science, vol.68, issue.5, pp.16-33, 2002.
DOI : 10.1016/S1571-0661(04)80518-8

E. Badouel, B. Caillaud, and P. Darondeau, Distributing Finite Automata Through Petri Net Synthesis, Formal Aspects of Computing, vol.13, issue.6, pp.447-470, 2002.
DOI : 10.1007/s001650200022

M. Bartoletti, P. Degano, and G. L. Ferrari, Enforcing Secure Service Composition, 18th IEEE Computer Security Foundations Workshop (CSFW'05), pp.211-223, 2005.
DOI : 10.1109/CSFW.2005.17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.3257

M. Bartoletti, P. Degano, and G. L. Ferrari, Checking Risky Events Is Enough for Local Policies, Lecture Notes in Computer Science, vol.3701, pp.97-112, 2005.
DOI : 10.1007/11560586_9

S. Basu and C. R. Ramakrishnan, Compositional Analysis for Verification of Parameterized Systems, Ninth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.315-330, 2003.
DOI : 10.1007/3-540-36577-X_23

L. Bauer, J. Ligatti, and D. Walker, More enforceable security policies, Foundations of Computer Security: proceedings of the FLoC'02 workshop on Foundations of Computer Security, pp.95-104, 2002.

L. Bauer, J. Ligatti, and D. Walker, Edit automata: Enforcement mechanisms for run-time security policies, International Journal of Information Security, vol.4, issue.12, pp.2-16, 2005.

J. Bradfield and C. Stirling, Modal logics and mu-calculi: an introduction. Handbook of Process Algebra, 2001.

G. Bruns and I. Sutherland, Model checking and fault tolerance, AMAST '97: Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology, pp.45-59, 1997.
DOI : 10.1007/BFb0000462

F. Corradini, D. Ortenzio, and P. Inverardi, On the relationships among four timed process algebras, Fundam. Inform, vol.38, issue.4, pp.377-395, 1999.

P. Cousot and R. Cousot, Abstract interpretation: a unified lattice model for staticanalysis of programs by construction or approximation offixpoints, Conference Record of the Fourth Annual ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages, pp.238-252, 1977.

J. Elmqvist, S. Nadjm-tehrani, and M. Minea, Safety Interfaces for Component-Based Systems, Lecture Notes in Computer Science, vol.3688, pp.246-260, 2005.
DOI : 10.1007/11563228_19

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

R. Focardi and S. Rossi, Information flow security in dynamic contexts, Journal of Computer Security, vol.14, issue.1, pp.65-110, 2006.
DOI : 10.3233/JCS-2006-14103

R. Focardi, R. Gorrieri, and F. Martinelli, Real-time information flow analysis, IEEE Journal on Selected Areas in Communications, vol.21, issue.1, pp.20-35, 2003.
DOI : 10.1109/JSAC.2002.806122

R. Gorrieri, R. Lanotte, A. Maggiolo-schettini, F. Martinelli, S. Tini et al., Automated analysis of timed security: a case study on web privacy, International Journal of Information Security, vol.29, issue.3-4, pp.3-4, 2004.
DOI : 10.1145/300307.300311

K. Havelund and G. Rosu, Synthesizing Monitors for Safety Properties, TACAS '02: Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.342-356, 2002.
DOI : 10.1007/3-540-46002-0_24

M. Hennessy, Algebraic Theory of Processes, 1988.

M. Hennessy and T. Regan, A temporal process algebra, FORTE '90: Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, pp.33-48, 1991.

C. A. Hoare, Communicating Sequential Processes, 1985.

P. C. Kanellakis and S. A. Smolka, CCS expressions, finite state processes, and three problems of equivalence, Information and Computation, vol.86, issue.1, pp.43-68, 1990.
DOI : 10.1016/0890-5401(90)90025-D

D. Kozen, Results on the Propositional ??-Calculus, DAIMI Report Series, vol.11, issue.146, pp.333-354, 1983.
DOI : 10.7146/dpb.v11i146.7420

O. Kupferman, P. Madhusudan, P. S. Thiagarajan, and M. Y. Vardi, Open Systems in Reactive Environments: Control and Synthesis, Lecture Notes in Computer Science, vol.1877, pp.92-107, 2000.
DOI : 10.1007/3-540-44618-4_9

O. Kupferman and M. Vardi, ??-Calculus Synthesis, Proc. 25th International Symposium on Mathematical Foundations of Computer Science, pp.497-507, 2000.
DOI : 10.1007/3-540-44612-5_45

X. Leroy, D. R. Doligez, J. Garrigue, and J. Vouillon, The Objective Caml system release 3.09, 2004.

O. Maler, A. Pnueli, and J. Sifakis, On the synthesis of discrete controllers for timed systems (extended abstract) Lecture notes in, Computer Science, vol.900, pp.229-242, 1995.

F. Martinelli, Formal Methods for the Analysis of Open Systems with Applications to Security Properties, 1998.

F. Martinelli, Partial model checking and theorem proving for ensuring security properties, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238), 1998.
DOI : 10.1109/CSFW.1998.683154

F. Martinelli, Towards automatic synthesis of systems without information leaks, Proceedings of Workshop in Issues in Theory of Security (WITS), 2000.

F. Martinelli, Module checking through partial model checking, 2002.

F. Martinelli, Analysis of security protocols as open systems, Theoretical Computer Science, vol.290, issue.1, pp.1057-1106, 2003.
DOI : 10.1016/S0304-3975(02)00596-0

F. Martinelli and I. Matteucci, Through Modeling to Synthesis of Security Automata, Electronic Notes in Theoretical Computer Science, vol.179, pp.31-46, 2007.
DOI : 10.1016/j.entcs.2006.08.029

I. Matteucci, A Tool for the Synthesis of Controller Programs, Formal Aspects in Security and Trust, pp.112-126, 2006.
DOI : 10.1007/978-3-540-75227-1_8

I. Matteucci, Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting, Electronic Notes in Theoretical Computer Science, vol.186, pp.101-120, 2007.
DOI : 10.1016/j.entcs.2007.03.025

I. Matteucci, Synthesis of Secure Systems, 2008.

P. Merlin and G. V. Bochmann, On the Construction of Submodule Specifications and Communication Protocols, ACM Transactions on Programming Languages and Systems, vol.5, issue.1, pp.1-25, 1983.
DOI : 10.1145/357195.357196

R. Milner, Operational and algebraic semantics of concurrent processes Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 19, pp.1201-1242

D. Park, Concurrency and automata on infinite sequences, Proceedings 5th GI Conference, pp.167-183, 1981.
DOI : 10.1007/BFb0017309

J. Raclet and S. Pinchinat, The control of non-deterministic systems: a logical approach, Proc. 16th IFAC Word Congress, 2005.

S. Riedweg and S. Pinchinat, Maximally permissive controllers in all contexts, Workshop on Discrete Event Systems, 2004.

S. Riedweg and S. Pinchinat, You can always compute maximally permissive controllers under partial observation when they exist, Proc. 2005 American Control Conference, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00556003

H. Saidi, Towards automatic synthesis of security protocols, Logic-Based Program Synthesis Workshop, AAAI Spring Symposium, 2002.

F. B. Schneider, Enforceable security policies, ACM Transactions on Information and System Security, vol.3, issue.1, pp.30-50, 2000.
DOI : 10.1145/353323.353382

R. S. Street and E. A. Emerson, An automata theoretic procedure for the propositional µ-calculus. Information and Computation, pp.249-264, 1989.

I. Ulidowski and S. Yuen, Extending process languages with time, AMAST '97: Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology, 1997.
DOI : 10.1007/BFb0000494

I. Walukiewicz, A Complete Deductive System for the mu-Calculus, BRICS Report Series, vol.2, issue.6, 1993.
DOI : 10.7146/brics.v2i6.19508

H. Wong-toi and D. L. Dill, Synthesizing processes and schedulers from temporal specifications, Lecture Notes in Computer Science, vol.531, pp.272-281, 1990.
DOI : 10.1007/BFb0023741