Arnold, André; Michalewski, Henryk; Niwiński, Damian On the separation question for tree languages. (English) Zbl 1245.68116 Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 396-407, electronic only (2012). MSC: 68Q45 03D05 PDFBibTeX XMLCite \textit{A. Arnold} et al., LIPIcs -- Leibniz Int. Proc. Inform. 14, 396--407 (2012; Zbl 1245.68116) Full Text: DOI
Arnold, André; Walukiewicz, Igor Nondeterministic controllers of nondeterministic processes. (English) Zbl 1215.93082 Flum, Jörg (ed.) et al., Logic and automata. History and perspectives. Dedicated to Wolfgang Thomas on the occasion of his sixtieth birthday. Amsterdam: Amsterdam University Press (ISBN 978-90-5356-576-6/pbk). Texts in Logic and Games 2, 29-52 (2008). MSC: 93C65 03D05 93B50 PDFBibTeX XMLCite \textit{A. Arnold} and \textit{I. Walukiewicz}, Texts Log. Games 2, 29--52 (2008; Zbl 1215.93082)
Arnold, André; Duparc, Jacques; Murlak, Filip; Niwiński, Damian On the topological complexity of tree languages. (English) Zbl 1244.03116 Flum, Jörg (ed.) et al., Logic and automata. History and perspectives. Dedicated to Wolfgang Thomas on the occasion of his sixtieth birthday. Amsterdam: Amsterdam University Press (ISBN 978-90-5356-576-6/pbk). Texts in Logic and Games 2, 9-28 (2008). MSC: 03D05 03E15 68Q45 PDFBibTeX XMLCite \textit{A. Arnold} et al., Texts Log. Games 2, 9--28 (2008; Zbl 1244.03116)
Arnold, André; Niwiński, Damian Continuous separation of game languages. (English) Zbl 1213.03051 Fundam. Inform. 81, No. 1-3, 19-28 (2007). MSC: 03D05 03E15 68Q45 PDFBibTeX XMLCite \textit{A. Arnold} and \textit{D. Niwiński}, Fundam. Inform. 81, No. 1--3, 19--28 (2007; Zbl 1213.03051)
Santocanale, Luigi; Arnold, André Ambiguous classes in \(\mu\)-calculi hierarchies. (English) Zbl 1070.68077 Theor. Comput. Sci. 333, No. 1-2, 265-296 (2005). MSC: 68Q45 68Q15 03D05 03D15 68Q60 03B45 PDFBibTeX XMLCite \textit{L. Santocanale} and \textit{A. Arnold}, Theor. Comput. Sci. 333, No. 1--2, 265--296 (2005; Zbl 1070.68077) Full Text: DOI
Arnold, A.; Vincent, A.; Walukiewicz, I. Games for synthesis of controllers with partial observation. (English) Zbl 1175.93148 Theor. Comput. Sci. 303, No. 1, 7-34 (2003). MSC: 93C65 91A43 03D05 68Q45 68Q60 68Q85 PDFBibTeX XMLCite \textit{A. Arnold} et al., Theor. Comput. Sci. 303, No. 1, 7--34 (2003; Zbl 1175.93148) Full Text: DOI
Arnold, André; Santocanale, Luigi Ambiguous classes in the games \(\mu\)-calculus hierarchy. (English) Zbl 1029.68095 Gordon, Andrew D. (ed.), Foundations of software science and computations structure. 6th international conference, FOSSACS 2003, held as part of the joint European conferences on theory and practice of software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2620, 70-86 (2003). MSC: 68Q60 03B70 91A80 PDFBibTeX XMLCite \textit{A. Arnold} and \textit{L. Santocanale}, Lect. Notes Comput. Sci. 2620, 70--86 (2003; Zbl 1029.68095) Full Text: Link
Arnold, A.; Niwiński, D. Rudiments of \(\mu\)-calculus. (English) Zbl 0968.03002 Studies in Logic and the Foundations of Mathematics. 146. Amsterdam: Elsevier. xvii, 277 p. (2001). Reviewer: Valentin F.Goranko (Johannesburg) MSC: 03-02 03-01 03B70 03G10 68Q70 08A70 03D05 06B23 03B45 68Q45 91A99 PDFBibTeX XMLCite \textit{A. Arnold} and \textit{D. Niwiński}, Rudiments of \(\mu\)-calculus. Amsterdam: Elsevier (2001; Zbl 0968.03002)
Arnold, André The \(\mu\)-calculus alternation-depth hierarchy is strict on binary trees. (English) Zbl 0945.68118 Theor. Inform. Appl. 33, No. 4-5, 329-339 (1999). MSC: 68Q45 03D05 PDFBibTeX XMLCite \textit{A. Arnold}, Theor. Inform. Appl. 33, No. 4--5, 329--339 (1999; Zbl 0945.68118) Full Text: DOI EuDML
Arnold, André A selection property of the boolean \(\mu\)-calculus and some of its applications. (English) Zbl 0936.03030 RAIRO, Inform. Théor. Appl. 31, No. 4, 371-384 (1997). Reviewer: A.Nabebin (Moskva) MSC: 03B70 68Q60 03D05 06B23 06E30 68Q45 PDFBibTeX XMLCite \textit{A. Arnold}, RAIRO, Inform. Théor. Appl. 31, No. 4, 371--384 (1997; Zbl 0936.03030) Full Text: DOI EuDML
Arnold, André Finite transition systems. Semantics of communicating systems. Transl. from French by John Plaice. (Systèmes de transitions finis et sémantique de processus communicants). (English) Zbl 0796.68141 Prentice Hall International Series in Computer Science. Hemel Hempstead: Prentice Hall. Paris: Masson, 177 p. $ 60.00 /hc (1994). Reviewer: H.Stahn (Dresden) MSC: 68Q55 68Q85 68-02 03B70 PDFBibTeX XMLCite \textit{A. Arnold}, Finite transition systems. Semantics of communicating systems. Transl. from French by John Plaice. (Systèmes de transitions finis et sémantique de processus communicants). Hemel Hempstead: Prentice Hall; Paris: Masson (1994; Zbl 0796.68141)
Arnold, A.; Dicky, A. Equivalences and preorders of transition systems. (English) Zbl 0925.03145 Borzyszkowski, Andrzej M. (ed.) et al., Mathematical foundations of computer science 1993. 18th international symposium, MFCS ’93, Gdańsk, Poland, August/ September 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 711, 20-31 (1993). MSC: 03B70 68Q05 PDFBibTeX XMLCite \textit{A. Arnold} and \textit{A. Dicky}, Lect. Notes Comput. Sci. 711, 20--31 (1993; Zbl 0925.03145)
Arnold, André; Niwiński, Damian Fixed point characterization of weak monadic logic definable sets of trees. (English) Zbl 0794.03054 Nivat, Maurice (ed.) et al., Tree automata and languages. Amsterdam etc.: North-Holland. Stud. Comput. Sci. Artif. Intell. 10, 159-188 (1992). Reviewer: A.Nabebin (Moskva) MSC: 03D05 03B15 68Q45 05C05 68Q70 PDFBibTeX XMLCite \textit{A. Arnold} and \textit{D. Niwiński}, Stud. Comput. Sci. Artif. Intell. 10, 159--188 (1992; Zbl 0794.03054)
Arnold, André; Niwinski, Damian Fixed point characterization of Büchi automata on infinite trees. (English) Zbl 0721.68040 J. Inf. Process. Cybern. 26, No. 8-9, 451-459 (1990). MSC: 68Q45 03B45 03D05 03B70 PDFBibTeX XMLCite \textit{A. Arnold} and \textit{D. Niwinski}, J. Inf. Process. Cybern. 26, No. 8--9, 451--459 (1990; Zbl 0721.68040)
Arnold, André Logical definability of fixed points. (English) Zbl 0663.03024 Theor. Comput. Sci. 61, No. 2-3, 289-297 (1988). Reviewer: B.Wojdyło MSC: 03D05 03D70 08A99 68Q45 PDFBibTeX XMLCite \textit{A. Arnold}, Theor. Comput. Sci. 61, No. 2--3, 289--297 (1988; Zbl 0663.03024) Full Text: DOI
Arnold, A.; Dauchet, M. Caractérisation algébrique des ensembles recursivement enumerables d’arbres. (French) Zbl 0482.68076 Mathematiques appliquees, 1er Colloq. AFCET-SMF, Palaiseau 1978, Tome II, 1-13 (1978). MSC: 68Q45 03D25 05C05 68R10 PDFBibTeX XML
Arnold, Andre; Nivat, Maurice Metric interpretations of recursive program schemes. (English) Zbl 0469.68018 Ber., Abt. Inf., Univ. Dortm. 74, 11-22 (1978). MSC: 68Q60 68Q65 03D80 PDFBibTeX XML
Arnold, A.; Latteux, M. Recursivite et cônes rationnels fermés par intersection. (French) Zbl 0421.68075 Calcolo 15, 382-394 (1978). MSC: 68Q45 03D40 PDFBibTeX XMLCite \textit{A. Arnold} and \textit{M. Latteux}, Calcolo 15, 382--394 (1978; Zbl 0421.68075) Full Text: DOI