S. Abiteboul, L. Segoufin, and V. Vianu, Static analysis of Active XML systems, pp.221-230, 2008.

M. Ahuja, A. D. Kshemkalyani, and T. Carlson, A Basic Unit of Computation in Distributed Sytems, Proc. of ICDS'90, pp.12-19, 1990.

S. Akshay, B. Genest, L. Hélouët, and S. Yang, Regular set of representatives for time-constrained MSC graphs, Information Processing Letters, vol.112, issue.14-15, pp.14-15592, 2012.
DOI : 10.1016/j.ipl.2012.05.002
URL : https://hal.archives-ouvertes.fr/hal-00879825

S. Akshay, B. Genest, L. Hélouët, and S. Yang, Symbolically Bounding the Drift in Time-Constrained MSC Graphs, ICTAC, pp.1-15, 2012.
DOI : 10.1007/978-3-642-32943-2_1
URL : https://hal.archives-ouvertes.fr/hal-00879831

S. Akshay, L. Hélouët, C. Jard, D. Lime, and H. Olivier, Robustness of Time Petri Nets under Architectural Constraints, FORMATS, pp.11-26, 2012.
DOI : 10.1007/978-3-642-33365-1_3
URL : https://hal.archives-ouvertes.fr/hal-00879818

S. Akshay, L. Hélouët, C. Jard, and P. Reynier, Robustness of Time Petri Nets under Guard Enlargement, RP, pp.92-106, 2012.
DOI : 10.1007/978-3-642-33512-9_9
URL : https://hal.archives-ouvertes.fr/hal-01379431

S. Akshay, M. Mukund, and N. K. Kumar, Checking Coverage for Infinite Collections of Timed Scenarios, CONCUR'07, pp.181-196, 2007.
DOI : 10.1007/978-3-540-74407-8_13

S. Akshay, M. Mukund, K. Narayan, and . Kumar, Checking Coverage for Infinite Collections of Timed Scenarios, CONCUR, volume 4703 de Lecture Notes in Computer Science, pp.181-196, 2007.
DOI : 10.1007/978-3-540-74407-8_13

R. Alur and K. Etessami, Yannakakis : Inference of message sequence charts, ICSE, pp.304-313, 2000.

R. Alur and K. Etessami, Yannakakis : Realizability and verification of msc graphs, ICALP, pp.797-808, 2001.

R. Alur and K. Etessami, Realizability and verification of MSC graphs, Theoretical Computer Science, vol.331, issue.1, pp.97-114, 2005.
DOI : 10.1016/j.tcs.2004.09.034

R. Alur and G. Holzmann, An analyzer for message sequence charts, Lecture Notes in Computer Science, vol.1055, pp.35-48, 1996.
DOI : 10.1007/3-540-61042-1_37

R. Alur, Yannakakis : Model checking of Message sequence Charts, Proc. of CONCUR'99, numéro 1664 de LNCS, pp.114-129, 1999.

R. Alur and J. Gerard, Holzmann et Doron Peled : An analyzer for message sequence charts. Software -Concepts and Tools, pp.70-77, 1996.

S. Axelson, Intrusion detection systems: A taxomomy and surveytechnical report, 2000.

P. Baker, P. Bristow, C. Jervis, D. King, and B. Mitchell, Automatic Generation of Conformance Tests from Message Sequence Charts, In SAM, pp.170-198, 2002.
DOI : 10.1007/3-540-36573-7_12

N. Baudru and R. Morin, Synthesis of Safe Message-Passing Systems, FSTTCS, pp.277-289, 2007.
DOI : 10.1007/978-3-540-77050-3_23

A. Marek, L. Bednarczyk, B. Bernardinello, and . Caillaud, Wieslaw Pawlowski et Lucia Pomello : Modular system development with pullbacks, ICATPN, volume 2679 de Lecture Notes in Computer Science, pp.140-160, 2003.

D. Bell, J. , and L. Padula, Secure computer systems: a mathematical model. MITRE technical report 2547, MITRE, may 1973

D. Bell, J. , and L. Padula, Secure computer systems: mathematical foundations. Mitre technical report 2547, MITRE, march 1973

H. Ben-abdallah and S. Leue, Syntactic detection of process divergence and non-local choice in message sequence charts, Proceedings of the Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems TACAS'97, pp.259-274, 1997.
DOI : 10.1007/BFb0035393

A. Benveniste, E. Fabre, C. Jard, and S. Haar, Diagnosis of asynchronous discrete-event systems: a net unfolding approach, IEEE Transactions on Automatic Control, vol.48, issue.5, pp.714-727, 2003.
DOI : 10.1109/TAC.2003.811249
URL : https://hal.archives-ouvertes.fr/inria-00638345

B. Bollig, On the Expressiveness of Asynchronous Cellular Automata, FCT, pp.528-539, 0200.
DOI : 10.1007/11537311_46

B. Bollig and L. Hélouët, Realizability of Dynamic MSC Languages, CSR, pp.48-59, 2010.
DOI : 10.1007/978-3-642-13182-0_5
URL : https://hal.archives-ouvertes.fr/inria-00589714

B. Bollig, D. Kuske, and I. Meinecke, Propositional Dynamic Logic for Message-Passing Systems, FSTTCS, pp.303-315, 2007.
DOI : 10.1007/978-3-540-77050-3_25
URL : https://hal.archives-ouvertes.fr/hal-00779914

B. Bollig, D. Kuske, and I. Meinecke, Propositional dynamic logic for message-passing systems, Logical Methods in Computer Science, vol.6, issue.3, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00779914

B. Bollig, M. Leucker, and P. Lucas, Extending Compositional Message Sequence Graphs, LPAR, volume 2514 de Lecture Notes in Computer Science, pp.68-85, 2002.
DOI : 10.1007/3-540-36078-6_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.8142

P. Bouyer, N. Markey, and O. Sankur, Robust modelchecking of timed automata via pumping in channel machines, Proc. of FORMATS'11, pp.97-112

D. Brand and P. Zafiropulo, On Communicating Finite-State Machines, Journal of the ACM, vol.30, issue.2, pp.323-342, 1983.
DOI : 10.1145/322374.322380

D. Brand and P. Zafiropoulo, On communicating finite state machines . Rapport technique 1053, 1981.

P. Benoit-caillaud and . Darondeau, Lo¨?cLo¨?c Hélouët et Gilles Lesventes : HMSCs en tant que spécifications partielles et leurs complétions dans les réseaux de Petri, 2000.

L. Castellano, G. De-michelis-et-pomello, and L. , Concurrency versus interleaving: An instructive example, BEATCS: Bulletin of the European Association for Theoretical Computer Science, p.31, 1987.

E. Clarke, O. Grumberg, S. Jha, and Y. Lu, Veith : ounterexampleguided abstraction refinement, Proceedings of CAV'2000, pp.154-169, 2000.

E. M. Clarke and E. A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Logic of Programs, pp.52-71, 1981.
DOI : 10.1007/BFb0025774

W. Damm and D. Harel, Lscs: Breathing life into message sequence charts, Formal Methods in System Design, vol.19, issue.1, pp.45-80, 2001.
DOI : 10.1023/A:1011227529550
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.5472

P. Darondeau, B. Genest, and L. Hélouët, Products of Message Sequence Charts, FoSSaCS, pp.458-473, 2008.
DOI : 10.1007/978-3-540-78499-9_32
URL : https://hal.archives-ouvertes.fr/inria-00156035

P. Darondeau, B. Genest, and L. Hélouët, Products of Message Sequence Charts, Research Report, vol.6258, 2008.
DOI : 10.1007/978-3-540-78499-9_32
URL : https://hal.archives-ouvertes.fr/inria-00156035

P. Darondeau, L. Hélouët, and M. Mukund, Assembling Sessions, ATVA, pp.259-274, 2011.
DOI : 10.1007/978-3-642-24372-1_19
URL : https://hal.archives-ouvertes.fr/hal-00650950

V. Diekert, G. Rozenberg, and ´. , The Book of Traces, World Scientific, 1995.
DOI : 10.1142/2563

C. Duboc, Mixed product and asynchronous automata, Theoretical Computer Science, vol.48, issue.3, pp.183-199, 1986.
DOI : 10.1016/0304-3975(86)90094-0
URL : http://doi.org/10.1016/0304-3975(86)90094-0

C. Dufourd, A. Finkel, and . Ph, Schnoebelen : Reset nets between decidability and undecidability, ICALP, volume 1443 de Lecture Notes in Computer Science, pp.103-115, 1998.
DOI : 10.1007/bfb0055044
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.3693

A. Engels, Message refinement: Describing multi-level protocols in MSC, Proceedings of the 1st Workshop of the SDL Forum Society on SDL and MSC

C. Fidge, Logical time in distributed computing systems, Computer, vol.24, issue.8, pp.28-33, 1991.
DOI : 10.1109/2.84874

C. Fidge, Logical time in distributed computing systems, Computer, vol.24, issue.8, pp.28-33, 1991.
DOI : 10.1109/2.84874

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

P. Gastin and D. Kuske, Satisfiability and model checking for msodefinable temporal logics are in pspace, CONCUR, volume 2761 de Lecture Notes in Computer Science, pp.218-232, 2003.

T. Gazagnaire, Langages de Scénarios: Utiliser des Ordres Partiels pour Modéliser, Vérifier et Superviser des SystèmesParalì eles et Répartis, Thèse de doctorat, 2008.

T. Gazagnaire, B. Genest, L. Hélouët, and H. Marchand, Diagnosis from scenarios, and applications, Research Report RR, 2000.

T. Gazagnaire, B. Genest, L. Hélouët, P. S. Thiagarajan, and S. Yang, Causal Message Sequence Charts, CONCUR'07, pp.166-180, 2007.
DOI : 10.1007/978-3-540-74407-8_12
URL : https://hal.archives-ouvertes.fr/inria-00173529

T. Gazagnaire, B. Genest, L. Hélouët, P. S. Thiagarajan, and S. Yang, Causal Message Sequence Charts, Theoretical Computer Science, vol.410, issue.41, pp.4094-4110, 2009.
DOI : 10.1016/j.tcs.2009.06.013
URL : https://hal.archives-ouvertes.fr/inria-00173529

B. Genest and D. Kuske, A Kleene theorem and model checking algorithms for existentially bounded communicating automata, Information and Computation, vol.204, issue.6, pp.920-956, 2006.
DOI : 10.1016/j.ic.2006.01.005
URL : https://hal.archives-ouvertes.fr/hal-00306261

B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun, Infinite-state highlevel mscs: Model-checking and realizability, ICALP, volume 2380 de LNCS, pp.657-668, 2002.
DOI : 10.1007/3-540-45465-9_56
URL : https://hal.archives-ouvertes.fr/hal-00306255

B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun, Infinite-state high-level MSCs: Model-checking and realizability, Journal of Computer and System Sciences, vol.72, issue.4, pp.617-647, 2006.
DOI : 10.1016/j.jcss.2005.09.007
URL : https://hal.archives-ouvertes.fr/hal-00306255

B. Genest, Odyssée des Graphes de Diagrammes de Séquences (MSC- Graphes), Thèse de doctorat, 2004.

B. Genest, L. Hélouët, and A. Muscholl, High-Level Message Sequence Charts and Projections, CONCUR, volume 2761 de Lecture Notes in Computer Science, pp.308-322, 2003.
DOI : 10.1007/978-3-540-45187-7_21

B. Genest and M. Minea, Anca Muscholl et Doron Peled : Specifying and verifying partial order properties using template mscs, FoSSaCS, volume 2987 de Lecture Notes in Computer Science, pp.195-210, 2004.
DOI : 10.1007/978-3-540-24727-2_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.5552

B. Genest, A. Muscholl, and D. Kuske, A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms, Developments in Language Theory, pp.30-48, 2004.
DOI : 10.1007/978-3-540-30550-7_4
URL : https://hal.archives-ouvertes.fr/hal-00306258

J. A. Goguen and J. Meseguer, Security Policies and Security Models, 1982 IEEE Symposium on Security and Privacy, pp.11-20, 1982.
DOI : 10.1109/SP.1982.10014

G. Gottlob, C. Koch, and R. Pichler, Efficient algorithms for processing XPath queries, ACM Transactions on Database Systems, vol.30, issue.2, pp.444-491, 2005.
DOI : 10.1145/1071610.1071614

S. Govindaraju and D. Dill, Counterexample-guided choice of projections in approximate symbolic model checking, IEEE/ACM International Conference on Computer Aided Design. ICCAD, 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140), 2000.
DOI : 10.1109/ICCAD.2000.896460

E. L. Gunter, Anca Muscholl et Doron Peled : Compositional message sequence charts, TACAS, volume 2031 de Lecture Notes in Computer Science, pp.496-511, 2001.
DOI : 10.1007/s10009-002-0085-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.7286

L. Hélouët, R. Abdallah, and D. Bhatia, SOFAT : Scenario formal analysis toolbox, 2011.

L. Hélouët and M. Zeitoun, Degorre : Scenarios and covert channels, another game, Proc. Games in Design and Verification, 2004.

L. Hélouët, Distributed system requirement modeling with message sequence charts: the case of the RMTP2 protocol, Information and Software Technology, vol.45, issue.11, pp.701-714, 2003.
DOI : 10.1016/S0950-5849(03)00067-3

L. Hélouët, T. Hénin, and C. Chevrier, Automating Scenario Merging, In SAM Lecture Notes in Computer Science, vol.4320, pp.64-81, 2006.
DOI : 10.1007/11951148_5

L. Hélouët, C. Jard, and B. Caillaud, An event structure based semantics for high-level message sequence charts, Mathematical Structures in Computer Science, vol.12, issue.4, pp.377-402, 2002.

L. Hélouët-et-pierre and L. Maigat, Decomposition of message sequence charts, In SAM, pp.47-60, 2000.

L. Hélouët and A. Roumy, Covert channel detection using Information Theory, SecCo, pp.34-51, 2010.
DOI : 10.4204/EPTCS.51.3

L. Hélouët and A. Roumy, On the differences between covert channels and interference, GIPSY'2010 : 1st Workshop on Games, Logic and Security, 2010.

G. Jesper, M. Henriksen, K. Mukund, M. A. Narayan-kumar, and P. S. Sohoni, Thiagarajan : A theory of regular msc languages, Inf. Comput, vol.202, issue.1, pp.1-38, 2005.

G. Jesper, P. S. Henriksen, and . Thiagarajan, Dynamic linear time temporal logic, Ann. Pure Appl. Logic, vol.96, issue.1-3, pp.187-207, 1999.

L. Hélouët, T. Gazagnaire, and B. Genest, Diagnosis from Scenarios, 2006 8th International Workshop on Discrete Event Systems, 2006.
DOI : 10.1109/WODES.2006.1678447

L. Hélouët, M. Zeitoun, and C. Jard, Covert channels detection in protocols using scenarios, Proc. of SPV'03 Security Protocols Verification, pp.21-25, 2003.

L. Hélouët and C. Jard, Conditions for synthesis of communicating automata from hmscs, 5th International Workshop on Formal Methods for Industrial Critical Systems (FMICS), 2000.

J. E. Hopcroft and J. D. , Ullman : Introduction to Automata Theory, Languages and Computation, 1979.

. Donald and . Johnson, Finding all the elementary circuits of a directed graph, SIAM Journal of Computing, vol.4, issue.1, pp.77-84, 1975.

A. K. Jones and R. S. Sielken, Computer system intrusion detection: A survey, 1999.

P. Kabiri and A. A. Ghorbani, Research on intrusion detection and response: A survey, International Journal of Network Security, vol.1, issue.2, pp.84-102, 2005.

J. Klein, B. Caillaud, and L. Hélouët, Merging Scenarios, Electronic Notes in Theoretical Computer Science, vol.133, pp.193-215, 2005.
DOI : 10.1016/j.entcs.2004.08.065
URL : http://doi.org/10.1016/j.entcs.2004.08.065

D. Kleitman and B. Rotschild, Asymptotic enumeration of partial orders on a finite set. Transactions of the, pp.205-220, 1975.

C. Ko, M. Ruschitzka, and K. N. Levitt, Execution monitoring of securitycritical programs in distributed systems: A specification-based approach, IEEE Symposium on Security and Privacy, pp.175-187, 1997.

D. Kuske, Regular sets of infinite message sequence charts. Information and Computation, pp.80-109, 2003.

M. Leucker, P. Madhusudan, and S. Mukhopadhyay, Dynamic Message Sequence Charts, Proceedings of 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), volume 2556 de Lecture Notes in Computer Science, 2002.
DOI : 10.1007/3-540-36206-1_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.1898

K. Lodaya and P. Weil, Series???parallel languages and the bounded-width property, Theoretical Computer Science, vol.237, issue.1-2, pp.347-380, 2000.
DOI : 10.1016/S0304-3975(00)00031-1

M. Lohrey, Realizability of high-level message sequence charts: closing the gaps, Theoretical Computer Science, vol.309, issue.1-3, pp.529-554, 2003.
DOI : 10.1016/j.tcs.2003.08.002

M. Lohrey, Safe Realizability of High-Level Message Sequence Charts*, CONCUR, volume 2421 de Lecture Notes in Computer Science, pp.177-192, 2002.
DOI : 10.1007/3-540-45694-5_13

M. Lohrey and A. Muscholl, Bounded MSC communication, Information and Computation, vol.189, issue.2, pp.160-181, 2004.
DOI : 10.1016/j.ic.2003.10.002
URL : https://hal.archives-ouvertes.fr/hal-00306245

P. Madhusudan, Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs, Proceedings of ICALP'01, page 809, 2001.
DOI : 10.1007/3-540-48224-5_66

P. Madhusudan and B. Meenakshi, Beyond Message Sequence Graphs, FSTTCS, volume 2245 de Lecture Notes in Computer Science, pp.256-267, 2001.
DOI : 10.1007/3-540-45294-X_22

B. Masson, L. Hélouët, and A. Benveniste, Compatibility of Data-Centric Web Services, WS-FM, pp.32-47, 2011.
DOI : 10.1007/978-3-642-29834-9_4

F. Mattern, Time and global states of distributed systems, Proc. Int. Workshop on Parallel and Distributed Algorithms, pp.215-226, 1988.

F. Mattern, On the relativistic structure of logical time in distributed systems. Parallel and Distributed Algorithms, pp.215-226, 1989.

S. Mauw, M. Van-wijk, and T. Winter, A formal semantics of synchronous interworkings, SDL'93 : Using Objects, 1993.

S. Mauw and A. Michel, Reniers : Refinement in interworkings, CONCUR, volume 1119 de Lecture Notes in Computer Science, pp.671-686, 1996.

B. Meenakshi and R. Ramanujam, Reasoning about layered message passing systems, Computer Languages, Systems & Structures, vol.30, issue.3-4, pp.171-206, 2004.
DOI : 10.1016/j.cl.2004.02.003

M. Philip and . Merlin, A Study of the Recoverability of Computing Systems, Thèse de doctorat, 1974.

G. Miklau and D. Suciu, Containment and equivalence for a fragment of XPath, Journal of the ACM, vol.51, issue.1, pp.2-45, 2004.
DOI : 10.1145/962446.962448

J. Millen, Covert Channel Capacity, 1987 IEEE Symposium on Security and Privacy, pp.60-66, 1987.
DOI : 10.1109/SP.1987.10013

R. Morin, Recognizable Sets of Message Sequence Charts, STACS'02, volume 2285 de Lecture Notes in Computer Science, pp.523-534, 2002.
DOI : 10.1007/3-540-45841-7_43

I. Moskowitz and M. Kang, Covert channels-here to stay?, Proceedings of COMPASS'94, 1994 IEEE 9th Annual Conference on Computer Assurance, pp.235-243, 1994.
DOI : 10.1109/CMPASS.1994.318449
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.7901

M. Mukund, K. N. Kumar, and M. Sohoni, Synthesizing distributed finitestate systems from mscs, In CONCUR, pp.521-535, 2000.
DOI : 10.1007/3-540-44618-4_37

A. Muscholl, Matching Specifications for Message Sequence Charts, FoSSaCS, pp.273-287, 1999.
DOI : 10.1007/3-540-49019-1_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.4949

A. Muscholl and D. Peled, Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces, MFCS, pp.81-91, 1999.
DOI : 10.1007/3-540-48340-3_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7078

A. Muscholl and D. Peled, From Finite State Communication Protocols to High-Level Message Sequence Charts, Proceedings of ICALP'2001, pp.720-731, 2001.
DOI : 10.1007/3-540-48224-5_59

A. Muscholl, D. Peled, and Z. Su, Deciding properties for message sequence charts, FoSSaCS'98, volume 1378 de Lecture Notes in Computer Science, pp.226-242, 1998.

F. Neven and T. Schwentick, Xpath containment in the presence of disjunction, dtds, and variables, ICDT, pp.312-326, 2003.

F. Neven and T. Schwentick, On the complexity of xpath containment in the presence of disjunction, dtds, and variables. CoRR, abs, p.606065, 2006.

R. Paige and R. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, 1987.
DOI : 10.1137/0216062

D. Peled, Specification and Verification of Message Sequence Charts, Proceedings of FORTE'00, pp.139-154, 2000.
DOI : 10.1007/978-0-387-35533-7_9

A. Pnueli, Abstraction, composition, symmetry, and a little deduction: The remedies to state explosion, Proceedings of CAV'2000, 2000.

A. Puri, Dynamical properties of timed automata, DEDS, pp.87-113, 2000.
DOI : 10.1007/BFb0055349

M. Raynal, A. Schiper, and S. Toueg, The causal ordering abstraction and a simple way to implement it, Information Processing Letters, vol.39, issue.6, pp.343-350, 1991.
DOI : 10.1016/0020-0190(91)90008-6
URL : https://hal.archives-ouvertes.fr/inria-00075427

V. Rehák, P. S. Strejcek, and L. Hélouët, Decidable race condition and open coregions in hmsc, p.29, 2010.

M. Reniers, Message Sequence Chart: Syntax and Semantics, Thèse de doctorat, 1999.

M. Reniers and S. Mauw, High-level Message Sequence Charts, SDL97: Time for Testing -SDL, MSC and Trends, Proc. of the 8th SDL Forum, pp.291-306, 1997.

E. Rudolph, P. Graubmann, and J. Grabowski, Message Sequence Chart: composition techniques versus OO-techniques -'tema con variazioni editeurs : SDL'95 with MSC in CASE, Proceedings of the Seventh SDL Forum, pp.77-88, 1995.

A. Sabelfeld and A. C. Myers, Language-based information-flow security, IEEE Journal on Selected Areas in Communications, vol.21, issue.1, 2003.
DOI : 10.1109/JSAC.2002.806121
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.3979

O. Salem and S. Vaton, Gravey : An efficient online anomalies detection mechanism for high-speed networks, MonAM'07, 2007.

M. Sampath, R. Sengupta, S. Lafortune, K. Sinnamohideen, and D. Teneketzis, Failure diagnosis using discrete-event models, IEEE Transactions on Control Systems Technology, vol.4, issue.2, pp.105-124, 1996.
DOI : 10.1109/87.486338
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.852

R. Sekar, A. Gupta, J. Frullo, T. Shanbhag, A. Tiwari et al., Specification-based anomaly detection, Proceedings of the 9th ACM conference on Computer and communications security , CCS '02, 2002.
DOI : 10.1145/586110.586146

R. Tarjan, Depth-first search and linear graph algorithms, SIAM Journal of Computing, vol.1, issue.2, 1972.
DOI : 10.1109/swat.1971.10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

S. Uchitel, J. Kramer, and J. Magee, Detecting implied scenarios in Message Sequence Chart specifications, ESEC / SIGSOFT FSE, pp.74-82, 2001.

S. Uchitel, Incremental Elaboration of Scenario-Based Specifications and Behaviour Models Using Implied Scenarios, Thèse de doctorat, 2003.

S. Uchitel, J. Kramer, and J. Magee, Incremental elaboration of scenario-based specifications and behavior models using implied scenarios, ACM Transactions on Software Engineering and Methodology, vol.13, issue.1
DOI : 10.1145/1005561.1005563

D. Volpano and G. Smith, Eliminating covert flows with minimum typings, Proceedings 10th Computer Security Foundations Workshop, pp.156-168, 1997.
DOI : 10.1109/CSFW.1997.596807
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.8471

S. Yang, L. Hélouët, and T. Gazagnaire, Logic based diagnosis for distributed systems. Perspectives in Concurrency Theory, a Festchrift for P.S. Thiagarajan, pp.482-505, 2009.