M. [. Amadio and . Dam, Toward a modal theory of types for the ??-calculus, Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, pp.347-365, 1996.
DOI : 10.1007/3-540-61648-9_50

A. [. Amtoft, S. M. Kfoury, and . Pericas-geertsen, What Are Polymorphically-Typed Ambients?, 10th European Symposium on Programming, pp.206-220, 2001.
DOI : 10.1007/3-540-45309-1_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.1488

C. [. Amadio and . Meyssonnier, On Decidability of the Control Reachability Problem in the Asynchronous ?-Calculus, Nordic Journal of Computing, vol.9, issue.1, pp.70-101, 2002.

]. R. Ama97 and . Amadio, An Asynchronous model of Locality, Failure, and Process Mobility, Second International Conference on Coordination Languages and Models (COORDINATION'97, pp.374-391, 1997.

]. R. Ama00 and . Amadio, On Modelling Mobility, TCS, vol.240, issue.1, pp.147-176, 2000.

T. Amtoft, H. Makholm, and J. B. Wells, PolyA : True Type Polymorphism for Mobile Ambients, 3rd International Conference on Theoretical Computer Science (TCS2004), pp.591-604, 2004.

D. [. Arnold and . Niwinski, Rudiments of µ-Calculus, 2001.

S. [. Amadio and . Prasad, Localities and Failures, 14th Foundations of Software Tecchnology and Theoretical Computer Science, 1994.
DOI : 10.1007/3-540-58715-2_126

C. [. Andersen, G. Stirling, and . Winskel, A compositional proof system for the modal mu-calculus, 9th IEEE Annual Symposium on Logic in Computer Science (LICS'94), pp.144-153, 1994.

G. [. Berry and . Boudol, The chemical abstract machine, Theoretical Computer Science, vol.96, issue.1, pp.217-248, 1992.
DOI : 10.1016/0304-3975(92)90185-I
URL : https://hal.archives-ouvertes.fr/inria-00075426

M. [. Barbanera, M. Bugliesi, V. Dezani-ciancaglini, and . Sassone, A Calculus of Bounded Capacities, Advances in Computing Science -ASIAN 2003 Programming Languages and Distributed Computation, 8th Asian Computing Science Conference, pp.205-223, 2003.
DOI : 10.1007/978-3-540-40965-6_14

G. [. Bugliesi, S. Castagna, and . Crafa, Boxed Ambients, Theoretical Aspects of Computer Software, pp.38-63, 2001.
DOI : 10.1007/3-540-45500-0_2
URL : https://hal.archives-ouvertes.fr/hal-00152525

G. [. Benzaken, A. Castagna, and . Frisch, CDuce : an XML-centric general-purpose language, Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP 2003, pp.51-63, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00152619

. Bdm-+-05-]-m, C. Bojanczyk, A. David, T. Muscholl, L. Schwentick et al., Two-variable logic on words with data, 2005.

J. [. Bloem and . Engelfriet, A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars, Journal of Computer and System Sciences, vol.61, issue.1, pp.1-50, 2000.
DOI : 10.1006/jcss.1999.1684

A. Brüggemann-klein, M. Murata, and D. Wood, Regular Tree and Regular Hedge Languages over Unranked Alphabets : Version 1, 2001.

L. [. Benedikt and . Libkin, Tree extension algebras: logics, automata, and query languages, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.203-212, 2002.
DOI : 10.1109/LICS.2002.1029829
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.6841

L. [. Barceló and . Libkin, Temporal logics over unranked trees Asynchrony and the Pi-calculus, 20th IEEE Symposium on Logic in Computer Science (LICS 2005)BS02] A. Berlea and H. Seidl. Binary queries. In Extreme Markup Languages 2002 Conference, pp.31-40, 1992.

P. Bidinger, A. Schmitt, and J. Stefani, An Abstract Machine for the Kell Calculus, 7th IFIP WG 6.1 International Conference, pp.31-46, 2005.
DOI : 10.1007/3-540-47959-7_3

G. [. Busi and . Zavattaro, On the Expressiveness of Movement in Pure Mobile Ambients, Foundations of Wide Area Network Computing, 2002.
DOI : 10.1016/S1571-0661(04)80414-6

G. [. Busi and . Zavattaro, On the expressive power of movement and restriction in pure mobile ambients, Theoretical Computer Science, vol.322, issue.3, pp.477-551, 2004.
DOI : 10.1016/j.tcs.2003.10.040

G. [. Busi and . Zavattaro, Deciding Reachability in Mobile Ambients, 14th European Symposium on Programming (ESOP 2005), pp.248-262, 2005.
DOI : 10.1007/978-3-540-31987-0_18

]. J. Büc60 and . Büchi, Weak second-order arithmetic and finite automata, Zeitschrift für mathematische Logik und Grundladen der Mathematik, pp.66-92, 1960.

]. L. Car99 and . Cardelli, Secure Internet Programming : Security Issues for Mobile and Distributed Objects, Lecture Notes in Computer Science, chapter Abstractions for Mobile Computation, vol.1603, pp.51-94, 1999.

L. [. Caires and . Cardelli, A Spatial Logic for Concurrency (Part II), CONCUR 2002 -Concurrency Theory, 13th International Conference, pp.209-225, 2002.
DOI : 10.1007/3-540-45694-5_15

L. [. Caires and . Cardelli, A spatial logic for concurrency (part i) Information and Computation, pp.194-235, 2003.

C. Calcagno, L. Cardelli, and A. D. Gordon, Deciding validity in a spatial logic for trees, ACM SIGPLAN Workshop on Types in Language Design and Implementation SIGPLAN Notices, pp.62-73, 2003.

M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison et al., Tree automata techniques and applications Available on : http://www.grapp a. univ-lille3.fr /ta ta, TQL algebra and its implementation. In 2 nd IFIP International Conference on Theoretical Computer Science IFIP Conference Proceedings, pp.422-434, 1997.

A. [. Cardelli and . Gordon, Mobile ambients, Foundations of Software Science and Computational Structures (FOSSACS'98), pp.140-155, 1998.
DOI : 10.1007/BFb0053547
URL : http://doi.org/10.1016/s0304-3975(99)00231-5

A. [. Cardelli and . Gordon, Types for mobile ambients, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '99, pp.79-92, 1999.
DOI : 10.1145/292540.292550

]. L. Cg00a, A. D. Cardelli, and . Gordon, Anytime, anywhere : Modal logics for mobile ambients, 27th Symp. on Principles of Programming Languages (POPL'00), pp.365-377177, 2000.

]. L. Cg01a, G. Cardelli, and . Ghelli, A query language based on the ambient logic, European Symposium on Programming, pp.1-22, 2001.

]. L. Cg01b, A. D. Cardelli, and . Gordon, Logical Properties of Name Restriction, 5th International Conference on Typed Lambda Calculi and Applications, pp.46-60, 2001.

]. L. Cg04a, G. Cardelli, and . Ghelli, TQL : a query language for semistructured data based on the ambient logic, Mathematical Structures in Computer Science, vol.14, issue.3, pp.285-327, 2004.

G. Conforti and G. Ghelli, Decidability of Freshness, Undecidability of Revelation, Foundations of Software Science and Computation Structures, 7th International Conference, pp.105-120, 2004.
DOI : 10.1007/978-3-540-24727-2_9

. Cga-+-02-]-g, G. Conforti, A. Ghelli, D. Albano, P. Colazzo et al., The query language TQL, WebDB, pp.13-18, 2002.

L. Cardelli, P. Gardner, and G. Ghelli, A Spatial Logic for Querying Graphs, 29th International Colloquium on Automata, Languages and Programming (ICALP), pp.597-610, 2002.
DOI : 10.1007/3-540-45465-9_51

]. L. Cgar, A. D. Cardelli, and . Gordon, Ambient logic, Mathematical Structures in Computer Science

]. B. Chi00 and . Chidlovskii, Using regular tree automata as xml schemas, IEEE Advances in Digital Libraries, pp.89-104, 2000.

L. [. Caires and . Monteiro, Verifiable and executable logic specifications of concurrent objects in $$\mathcal{L}_\pi$$, 7th European Symposium on Programming Languages and Systems (ESOP'98), pp.42-56, 1998.
DOI : 10.1007/BFb0053562

]. B. Cou90 and . Courcelle, The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs, IC, vol.85, issue.1, pp.12-75, 1990.

]. B. Cou94 and . Courcelle, The monadic second order logic of graphs VI : on several representations of graphs by relational structures Basic notions of universal algebra for language theory and graph grammars, Cou96] B. Courcelle, pp.117-149, 1994.

J. [. Cleaveland, B. Parrow, and . Steffen, The concurrency workbench, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.15, issue.1, pp.36-72, 1993.
DOI : 10.1007/3-540-52148-8_3

]. S. Dal00 and . Dal-zilio, Spatial congruence for ambients is decidable, 6th Asian Computing Science Conference, pp.88-103, 1961.

]. S. Dal01 and . Dal-zilio, Mobile Processes : a Commented Bibliography, Modeling and Verification of Parallel Processes, pp.206-222, 2000.

]. M. Dam88 and . Dam, Relevance logic and concurrent composition, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, pp.178-185, 1988.
DOI : 10.1109/LICS.1988.5116

]. M. Dam90 and . Dam, Relevance logic and concurrent composition, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, 1990.
DOI : 10.1109/LICS.1988.5116

]. M. Dam96 and . Dam, Model checking mobile processes. Information and Computation, pp.35-51, 1996.

]. M. Dam97 and . Dam, On the decidability of process equivalences for the ??-calculus, Theoretical Computer Science, vol.183, issue.2, pp.215-228, 1997.
DOI : 10.1016/S0304-3975(96)00325-8

D. [. Dam and . Gurov, Compositional Verification of CCS Processes, Perspectives of System Informatics, Third International Andrei Ershov Memorial Conference (PSI'99), volume 1755 of Lecture Notes in Computer Science, pp.247-256, 1999.
DOI : 10.1007/3-540-46562-6_22

]. A. Dgg04a, P. Dawar, G. Gardner, and . Ghelli, Adjunct elimination through games in static ambient logic, FSTTCS 2004 : Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, pp.211-223, 2004.

A. Dawar, P. Gardner, and G. Ghelli, Expressiveness and complexity of graph logic, Information and Computation, vol.205, issue.3, 2004.
DOI : 10.1016/j.ic.2006.10.006

D. [. Dal-zilio, C. Lugiez, and . Meyssonnier, A logic you can count on, Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.135-146, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071562

[. Ebbinghaus and J. Flum, Finite model theory. Perspectives in Mathematical Logic, 1995.

J. [. Emerson and . Halpern, Decision procedures and expressiveness in the temporal logic of branching time, Proceedings of the fourteenth annual ACM Symposium on Theory of Computing (STOC'82), pp.169-180, 1982.

A. [. Esparza and . Kiehn, On the model checking problem for branching time logics and basic parallel processes, 7th International Conference on Computer Aided Verification (CAV'95), pp.353-366, 1995.
DOI : 10.1007/3-540-60045-0_62

M. [. Engberg and . Nielsen, A calculus of communicating systems with label passing? ten years after, Proof, Language, and Interaction ; Essays in Honour of Robin Milner, pp.599-622, 2000.

]. J. Esp97 and . Esparza, Decidability of model-checking for infinite-state concurrent systems, Acta Informatica, vol.34, pp.85-107, 1997.

G. [. Frisch, V. Castagna, M. Benzaken, and . Grohe, Semantic subtyping The complexity of first-order and monadic second-order logic revisited, 17th IEEE Symposium on Logic in Computer Science 17th IEEE Symposium on Logic in Computer Science, pp.137-146, 2002.

R. [. Fischer and . Ladner, Propositional modal logic of programs, Proceedings of the ninth annual ACM symposium on Theory of computing , STOC '77, pp.194-211, 1977.
DOI : 10.1145/800105.803418

L. [. Gordon and . Cardelli, Equational Properties of Mobile Ambients, Mathematical Structures in Computer Science, vol.12, pp.1-38, 2002.

A. [. Gaubert and . Giua, Petri Net Languages and Infinite Subsets of Nm, Journal of Computer and System Sciences, vol.59, issue.3, pp.373-391, 1999.
DOI : 10.1006/jcss.1999.1634

[. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

G. Gottlob and C. Koch, Monadic queries over tree-structured data, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.189-202, 2002.
DOI : 10.1109/LICS.2002.1029828

C. [. Gottlob, K. U. Koch, and . Schulz, Conjunctive queries over trees, Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp.189-200, 2004.

K. [. Goubault-larrecq and . Verma, Alternating Two-way AC-Tree Automata, 2002.

]. U. Gol88 and . Goltz, On Representing CCS Programs by Finite Petri Nets, Mathematical Foundations on Computer Science, pp.339-350, 1988.

A. [. Gabbay and . Pitts, A new approach to abstract syntax involving binders, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.214-224, 1999.
DOI : 10.1109/LICS.1999.782617

Y. [. Guan, J. Yang, and . You, Making Ambients more Robust, International Conference on Software : Theory and Practice, pp.377-384, 2000.

]. D. Hir99 and . Hirschkoff, Mise en oeuvre de preuves de bisimulation, Ecole Nationale des Ponts et Chausses, 1999.

E. [. Hirschkoff, D. Lozes, and . Sangiorgi, Separability, expressiveness, and decidability in the ambient logic, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.423-432, 2002.
DOI : 10.1109/LICS.2002.1029850

R. [. Hennessy and . Milner, On observing nondeterminism and concurrency, 7th Colloquium on Automata, Languages and Programming, pp.299-309, 1980.
DOI : 10.1007/3-540-10003-2_79

B. [. Hosoya and . Pierce, XDuce, ACM Transactions on Internet Technology, vol.3, issue.2, pp.117-148, 2003.
DOI : 10.1145/767193.767195

P. [. Ishtiaq and . O-'hearn, Bi as an assertion language for mutable data structures, 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.14-26, 2001.

]. D. Koz83 and . Kozen, Results on the propositional mu -calculus, Theoretical Computer Science, vol.27, issue.3, pp.333-354, 1983.

H. [. Klaedtke and . Rueß, Monadic Second-Order Logics with Cardinalities, 30th International Colloquium on Automata, Languages and Programming, 2003.
DOI : 10.1007/3-540-45061-0_54

]. K. Lar88 and . Larsen, Proof system for hennessy-milner logic with recursion, 13th Colloquium on Trees in Algebra and Programming, pp.215-230, 1988.

]. E. Lei94 and . Leiss, Unrestricted complementation in language equations over a one-letter alphabet, Theoretical Computer Science, vol.132, issue.2, pp.71-84, 1994.

]. L. Lib05 and . Libkin, Logics for unranked trees : An overview, Automata, Languages and Programming , 32nd International Colloquium, ICALP 2005, pp.35-50, 2005.

F. [. Libkin and . Neven, Logical definability and query languages over unranked trees, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.178-187, 2003.
DOI : 10.1109/LICS.2003.1210057
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.1128

]. E. Loz04 and . Lozes, Adjuncts elimination in the static ambient logic, 10th International Workshop on Expressiveness in Concurrency (EXPRESS'03), pp.51-72, 2004.

D. [. Levi and . Sangiorgi, Controlling interference in ambients, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '00, pp.352-364, 2000.
DOI : 10.1145/325694.325741

P. [. Lugiez and . Schnoebelen, The regular viewpoint on PA-processes, Theoretical Computer Science, vol.274, issue.1-2, pp.89-115, 2002.
DOI : 10.1016/S0304-3975(00)00306-6
URL : https://hal.archives-ouvertes.fr/inria-00073287

[. Lugiez, Multitree automata that count, Theoretical Computer Science, vol.333, issue.1-2, pp.225-263, 2005.
DOI : 10.1016/j.tcs.2004.10.023
URL : http://doi.org/10.1016/j.tcs.2004.10.023

]. M. Mar04 and . Marx, Conditional xpath, the first order complete xpath dialect, Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp.13-22, 2004.

]. E. May84 and . Mayr, An Algorithm for the General Petri Net Reachability Problem, SIAM Journal of Computing, vol.13, issue.3, pp.441-460, 1984.

]. R. May97 and . Mayr, Model checking PA-processes, Conference on Concurrency TheoryMil80] R. Milner. A Calculus of Communicating Systems, pp.332-346, 1980.

]. R. Mil89 and . Milner, Communication and Concurrency, 1989.

]. R. Mil90 and . Milner, Functions as processes, Proceedings ICALP '90, pp.167-180, 1990.

I. [. Maffeis and . Phillips, On the computational strength of pure ambient calculi, Theoretical Computer Science, vol.330, issue.3, pp.501-551, 2005.
DOI : 10.1016/j.tcs.2004.10.007

T. [. Maneth, A. Perst, H. Berlea, and . Seidl, XML type checking with macro tree transducers, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '05, 2005.
DOI : 10.1145/1065167.1065203
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.549

J. [. Milner, J. Parrow, and . Walker, A calculus of mobile processes, II, Information and Computation, vol.100, issue.1, pp.1-4041, 1992.
DOI : 10.1016/0890-5401(92)90009-5

J. [. Milner, D. Parrow, and . Walker, Modal logics for mobile processes, Theoretical Computer Science, vol.114, issue.1, pp.149-171, 1993.
DOI : 10.1016/0304-3975(93)90156-N
URL : http://doi.org/10.1016/0304-3975(93)90156-n

]. M. Mur99 and . Murata, Hedge Automata : A Formal Model for XML Schemata, 1999.

J. [. Mezei and . Wright, Algebraic automata and context-free sets, Information and Control, vol.11, issue.1-2, pp.3-29, 1967.
DOI : 10.1016/S0019-9958(67)90353-1
URL : http://doi.org/10.1016/s0019-9958(67)90353-1

[. Nielson and F. Nielson, Shape analysis for mobile ambients, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '00, pp.142-154, 2000.
DOI : 10.1145/325694.325711

A. [. Niehren and . Podelski, Feature automata and recognizable sets of feature trees, TAPSOFT'93 : Theory and Practice of Software Development, International Joint Conference CAAP/FASE, pp.356-375
DOI : 10.1007/3-540-56610-4_76
URL : https://hal.archives-ouvertes.fr/inria-00536823

H. [. Neumann and . Seidl, Locating Matches of Tree Patterns in Forests, Foundations of Software Technology and Theoretical Computer Science, 18th Conference, pp.134-145, 1998.
DOI : 10.1007/978-3-540-49382-2_12

T. [. Neven and . Schwentick, Expressive and efficient pattern languages for tree-structured data, Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp.145-156, 2000.

T. [. Neven and . Schwentick, Automata- and Logic-Based Pattern Languages for Tree-Structured Data, Semantics in Databases, pp.160-178, 2001.
DOI : 10.1007/3-540-36596-6_9

T. [. Neven and . Schwentick, Query automata over finite trees, Theoretical Computer Science, vol.275, issue.1-2, pp.633-674, 2002.
DOI : 10.1016/S0304-3975(01)00301-2
URL : http://doi.org/10.1016/s0304-3975(01)00301-2

T. [. Neven, V. Schwentick, and . Vianu, Towards Regular Languages over Infinite Alphabets, 26th International Symposium, MFCS 2001, pp.560-572, 2001.
DOI : 10.1007/3-540-44683-4_49
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2304

J. [. Neven and . Van-den-bussche, Expressiveness of structured document query languages based on attribute grammars, Journal of the ACM, vol.49, issue.1, pp.56-100, 2002.
DOI : 10.1145/505241.505245

A. Okhotin, Conjunctive grammars, Journal of Automata, Languages and Combinatorics, vol.6, issue.4, pp.519-535, 2001.

]. R. Par66 and . Parikh, On Context-Free Languages, Plo81] G.D. Plotkin. A Structural Approach to Operational Semantics, pp.570-581, 1966.

]. A. Pnu77 and . Pnueli, The temporal logic of programs, Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pp.46-67, 1977.

]. E. Pos44 and . Post, Recursively Enumerable Sets of Positive Integers and their Decision Problems. Bulletion of the, pp.284-316, 1944.

V. [. Papakonstantinou and . Vianu, DTD inference for views of XML data, Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '00, pp.35-46, 2000.
DOI : 10.1145/335168.335173

M. [. Phillips and . Vigliotti, On Reduction Semantics for the Push and Pull Ambient Calculus, 2nd IFIP International Conference on Theoretical Computer Science, pp.550-562, 2002.
DOI : 10.1007/978-0-387-35608-2_45

]. M. Rab69 and . Rabbin, Decidability of second-order theories and automata on infinite trees. Transactions of the, pp.1-35, 1969.

]. C. Rac78 and . Rackoff, The covering and boundedness problems for vector addition systems, Theoretical Computer Science, vol.6, pp.223-231, 1978.

J. [. Röckl and . Esparza, Proof-Checking Protocols Using Bisimulations, Conference on Concurrency Theory (CONCUR'99), pp.525-540, 1999.
DOI : 10.1007/3-540-48320-9_36

J. C. Reynolds, Separation logic: a logic for shared mutable data structures, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.55-74, 2002.
DOI : 10.1109/LICS.2002.1029817

M. [. Riely and . Hennessy, A Typed Language for Distributed Mobile Processes, 25th ACM Symposium on Principles of Programming Languages (POPL'98), pp.378-390, 1998.

]. D. San01 and . Sangiorgi, Extensionality and intensionality of the ambient logics, ACM SIGPLAN Notices, vol.36, issue.3, pp.4-13, 2001.

T. [. Seidl, A. Schwentick, and . Muscholl, Numerical document queries, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.155-166, 2003.
DOI : 10.1145/773153.773169
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.4976

]. C. Sti89 and . Stirling, An introduction to modal and temporal logics for CCS, Concurrency : Theory, Language, And Architecture, pp.2-20, 1989.

M. [. Sattler and . Vardi, The Hybrid ??-Calculus, Automated Reasoning, First International Joint Conference, pp.76-91, 2001.
DOI : 10.1007/3-540-45744-5_7

D. [. Stirling and . Walker, Local model checking in the modal mu-calculus, pp.161-177, 1991.

]. B. Tra50 and . Trakhtenbrot, The impossibility of an algorithm for the decision problem for finite models, Doklady Akademii Nauk SSR, vol.70, pp.569-572, 1950.

J. [. Thatcher, P. Wright, D. Zimmer, and . Hirschkoff, Generalized finite automata with an application to a decision problem of second-order logic Using Ambients to Control Resources, Mathematical System Theory 19th International Conference on Concurrency Theory (CONCUR'02), volume 2421 of Lecture Notes in Computer Science, pp.57-82, 1968.

]. A. Urq72 and . Urquhart, Semantics for relevant logics, Journal of Symbolic Logic, vol.37, issue.1, pp.159-169, 1972.

]. W3c99a and . W3c, XML Path Language (XPATH) World Wide Web Consortium, 1999.

]. G. Win85 and . Winskel, A complete system for SCCS with modal assertions, Fifth Conference on Foundations of Software Technology and Theoretical Computer Science, pp.392-410, 1985.

]. G. Win91 and . Winskel, A note on model checking the modal nu-calculus, Theoretical Computer Science, vol.83, issue.1, pp.157-167, 1991.

]. P. Zim03 and . Zimmer, On the Expressiveness of Pure Safe Ambients, Mathematical Structures of Computer Science, vol.13, issue.5, pp.721-770, 2003.

A. Annexe and A. Publications, 1 Revues internationales [1] Jean-Marc Talbot. The ?? 2 Fragment of the First-Order Theory of Atomic Set Constraints is ? 0 1 -hard, Information Processing Letters, vol.74, issue.12, pp.27-33, 2000.

W. Charatonik, S. Dal-zilio, A. D. Gordon, S. Mukhopadhyay, and J. Talbot, Model checking mobile ambients, Theoretical Computer Science, vol.308, issue.1-3, pp.277-331, 2003.
DOI : 10.1016/S0304-3975(02)00832-0

I. Boneva and J. Talbot, When ambients cannot be opened, Theoretical Computer Science, vol.333, issue.1-2, pp.127-169, 2005.
DOI : 10.1016/j.tcs.2004.10.020
URL : https://hal.archives-ouvertes.fr/inria-00536732

J. Talbot, On Theorem-proving in Horn Theories with Built-in Algebras, A.2 Conférences internationales avec actes et comité de lecture [5] Nirina Andrianarivelo, Wadoud Bousdira, Third International Conference on Artificial Intelligence and Symbolic Mathematical Computation -AISMC3, volume 1138 of Lecture Notes in Computer Science, pp.320-338, 1996.

P. Devienne, J. Talbot, and S. Tison, Set-Based Analysis for Logic Programming and Tree Automata, Fourth International Static Analysis Symposium -SAS'97, pp.127-140, 1997.

P. Devienne, J. Talbot, and S. Tison, Solving classes of set constraints with tree automata, Third International Conference on Constraint Programming (CP), pp.62-76, 1997.
DOI : 10.1007/BFb0017430

P. Devienne, J. Talbot, and S. Tison, Co-definite Set Constraints with Membership Expressions, Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming (JICSLP-98), pp.25-39, 1998.

M. Müller, J. Niehren, and J. Talbot, Entailment of Atomic Set Constraints is PSPACE-Complete, Fourteenth Annual IEEE Symposium on Logic in Computer Sience, pp.285-294, 1999.

W. Charatonik, A. Podelski, and J. Talbot, Paths vs. Tress in Set-based Program Analysis, Principles of Programming Languages -POPL, pp.330-338, 2000.

J. Talbot, On the Alternation-Free Horn µ-Calculus, Seventh International Conference on Logic for Programming and Automated reasoning -LPAR'2000, pp.418-435, 1955.

W. Charatonik and J. Talbot, The Decidability of Model Checking Mobile Ambients, Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic (CSL'01), pp.339-354, 2001.
DOI : 10.1007/3-540-44802-0_24

W. Charatonik, S. Dal-zilio, A. D. Gordon, S. Mukhopadhyay, and J. Talbot, The Complexity of Model Checking Mobile Ambients, Proceedings FoSSaCS'01, pp.152-167, 2001.
DOI : 10.1007/3-540-45315-6_10

W. Charatonik, A. D. Gordon, and J. Talbot, Finite-Control Mobile Ambients, European Symposium on Programming -ESOP 2002, pp.295-313, 2002.
DOI : 10.1007/3-540-45927-8_21

W. Charatonik and J. Talbot, Atomic Set Constraints with Projection, International Conference on Rewriting Techniques and Applications -RTA 2002, pp.311-325, 2002.
DOI : 10.1007/3-540-45610-4_22

I. Boneva and J. Talbot, When Ambients Cannot Be Opened, Sixth International Conference on Foundations of Software Science and Computation Structures -FOSSACS 2003, pp.169-184, 2003.
DOI : 10.1007/3-540-36576-1_11
URL : https://hal.archives-ouvertes.fr/inria-00536732

I. Boneva and J. Talbot, On Complexity of Model-Checking for the TQL Logic, 3rd IFIP International Conference on Theoretical Computer Science (IFIP-TCS'04), pp.381-394, 2004.
DOI : 10.1007/1-4020-8141-3_30

I. Boneva and J. Talbot, Automata and Logics for Unranked and Unordered Trees, International Conference on Rewriting Techniques and Applications (RTA 2005), pp.500-515, 2005.
DOI : 10.1007/978-3-540-32033-3_36
URL : https://hal.archives-ouvertes.fr/inria-00536694

I. Boneva, J. Talbot, and S. Tison, Expressiveness of a Spatial Logic for Trees, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.280-289, 2005.
DOI : 10.1109/LICS.2005.17
URL : https://hal.archives-ouvertes.fr/inria-00536696

J. Niehren, L. Planque, J. Talbot, and S. Tison, N-Ary Queries by Tree Automata, Databases and Programming Languages, 2005.
DOI : 10.1007/11601524_14
URL : https://hal.archives-ouvertes.fr/inria-00536522

H. Ohsaki, J. Talbot, S. Tison, and Y. Roos, Monotone AC-Tree Automata, International Conference on Logic for Programming and Automated Reasoning (LPAR 2005), Lecture Notes in Computer Science, 2005.
DOI : 10.1007/11591191_24
URL : https://hal.archives-ouvertes.fr/inria-00536693