[Back]

Monograph


  1. A contribution to formal methods : games, logic and automata, Research Habilitation Thesis, Université de Bordeaux I, 2005 (hal).

  2. Propriétés logiques du non déterminisme et mu-calcul modal, PhD Thesis, Université de Bordeaux I, 1996.


Article


  1. Two-way automata and regular languages of overlapping tiles  (with A. Dicky), Fundamenta Informaticae  141:311-343, 2015  (doi)  (hal)  (pdf).

  2. On Labeled Birooted Trees Languages: Algebras, Automata and Logic, Information and Computation  243:222-248, 2015  (doi)  (hal)  (pdf).

  3. A syntactic congruence for languages of birooted trees  (with A. Blumensath), Semigroup Forum  , 2014  (doi)  (hal)  (pdf).

  4. Une étude des jeux distribués  (with J. Bernet), Technique et Science Informatique  32 (9-10):1007-1041, 2013  (doi)  (hal)  (pdf).

  5. Advanced synchronization of audio or symbolic musical patterns: an algebraic approach  (with F. Berthaut and B. Martin), International Journal of Semantic Computing  6 (4):409-427, 2012  (doi)  (hal)  (pdf).

  6. Vers une modélisation combinatoire des structures rythmiques simples de la musique, Revue Francophone d'Informatique Musicale (RFIM)  2, 2012 (hal)  (pdf) (related slides).

  7. The monadic theory of finite representations of infinite words  (with A. Dawar), Inf. Process. Lett.  103 (3):94-101, 2007 (hal)  (pdf).

  8. On the relationship between weak monadic second order logic on arbitrary trees, with application to the mu-calculus  (with G. Lenzi), Fundam. Inform.  61 (3-4):247-265, 2004 (hal)  (pdf).

  9. Permissive strategies: from parity games to safety games  (with J. Bernet and I. Walukiewicz), Theoretical Informatics and Applications (RAIRO)  36:261-275, 2002 (hal)  (pdf).

  10. On the logical definability of topologically closed recognizable languages of infinite trees  (with G. Lenzi), Computing and Informatics  21:185-203, 2002 (hal)  (pdf).


Conference


  1. Pour un raffinement spatio-temporel tuilé  (with S. Archipoff), in Journées Francophones des Langages Applicatifs (JFLA), Saint-Malo, France, 2016 (hal)  (pdf).

  2. Vers une programmation réactive structurée  (with S. Archipoff), in Actes des Journées d'informatique Musicale (JIM), 2016.

  3. Interpolations : e'critures de contraintes réactives pour improvisation pianistique (démo)  (with S. Archipoff et al. ), in Actes des Journées d'informatique Musicale (JIM), 2016.

  4. Walking automata in free inverse monoids, in Int. Conf. on Current Trends in Theo. and Prac. of Comp. Science (SOFSEM), LNCS 9587, pp 314-328, 2016 (hal)  (pdf).

  5. A robust algebraic framework for high-level music programming, in Second International Conference on Technologies for Music Notation and Representation (TENOR), 2016.

  6. Flux média tuilés polymorphes: une sémantique opérationnelle en Haskell  (with T. Bazin), in Journées Francophones des Langages Applicatifs (JFLA), 2015 (hal)  (pdf).

  7. Inverse monoids of higher-dimensional strings, in International Colloquium on Theoretical Aspects of Computing (ICTAC), LNCS 9399, 2015 (hal)  (pdf) (related slides).

  8. Des signaux aux symphonies: pour une modélisation homogène des objets sonores  (with M. Desainte-Catherine), in Actes des Journées d'informatique Musicale (JIM), 2015 (hal)  (pdf) (related slides).

  9. Embedding finite and infinite words into overlapping tiles  (with A. Dicky), in Developments in Language Theory (DLT), LNCS 8633, pp 339-347, 2014  (doi)  (hal)  (pdf).

  10. Algebraic tools for the overlapping tile product  (with E. Dubourg), in Language and Automata Theory and Applications (LATA), LNCS 8370, pp 335 - 346, 2014  (doi)  (hal)  (pdf).

  11. Tiled Polymorphic Temporal Media  (with P. Hudak), in Work. on Functional Art, Music, Modeling and Design (FARM), pp 49-60, Gothenburg, Sweden, 2014  (doi)  (hal)  (pdf).

  12. Programmer avec des tuiles musicales: le T-calcul en Euterpea  (with P. Hudak), in Actes des Journées d'informatique Musicale (JIM), 2014 (hal)  (pdf).

  13. Towards a higher dimensional string theory for the modeling of computerized systems, in Int. Conf. on Current Trends in Theo. and Prac. of Comp. Science (SOFSEM), LNCS 8327, pp 7-20, 2014  (doi)  (hal)  (pdf) (related slides).

  14. libTuile : un moteur d'exécution multi-échelle de processus musicaux hiérarchisés  (with F. Berthaut and M. Desainte-Catherine), in Actes des Journées d'informatique Musicale (JIM), 2013 (hal)  (pdf).

  15. Multi-scale design of interactive music systems : the libTuiles experiment  (with F. Berthaut and M. Desainte-Catherine), in Sound and Music Comp. (SMC), 2013 (hal)  (pdf) (related slides).

  16. On languages of one-dimensional overlapping tiles, in Int. Conf. on Current Trends in Theo. and Prac. of Comp. Science (SOFSEM), LNCS 7741, pp 244-256, 2013  (doi)  (hal)  (pdf).

  17. Overlaping tile automata, in 8th Int. Computer Science Symp. in Russia (CSR), LNCS 7913, pp 431-443, 2013  (doi)  (hal)  (pdf) (related slides).

  18. Algebras, automata and logic for languages of labeled birooted trees, in Int. Col. on Aut., Lang. and Programming (ICALP), LNCS 7966, pp 318-329, 2013  (doi)  (hal)  (pdf) (related slides).

  19. Modélisation algébrique du diner des philosophes  (with A. Dicky), in Modélisation des Systèmes Réactifs (MSR), in Journal Européen des Systèmes Automatisés (JESA Volume 47 - no 1-2-3/2013), 2013  (doi)  (hal)  (pdf) (related slides).

  20. The T-Calculus : towards a structured programming of (musical) time and space  (with F. Berthaut and M. DeSainte-Catherine and Y. Orlarey and S. Salvati), in Work. on Functional Art, Music, Modeling and Design (FARM), pp 23-34, 2013  (doi)  (hal)  (pdf) (related slides).

  21. Advanced synchronization of audio or symbolic musical patterns  (with F. Berthaut and B. Martin), in Sixth IEEE International Conference on Semantic Computing (ICSC), pp 202-209, 2012  (doi)  (hal)  (pdf) (related slides).

  22. Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles, in Mathematical Found. of Comp. Science (MFCS), LNCS 7464, pp 516-528, 2012  (doi)  (hal)  (pdf).

  23. A Lazy Real-Time System Architecture For Interactive Music, in Actes des Journées d'informatique Musicale (JIM), pp 133-139, 2012 (hal)  (pdf) (related slides).

  24. From asynchronous to synchronous specifications for distributed program synthesis  (with J. Bernet), in Int. Conf. on Current Trends in Theo. and Prac. of Comp. Science (SOFSEM), LNCS 4910, pp 162-173, 2008 (hal)  (pdf).

  25. On the (high) undecidability of distributed synthesis problems, in Int. Conf. on Current Trends in Theo. and Prac. of Comp. Science (SOFSEM), LNCS 4362, pp 320-329, 2007 (hal)  (pdf).

  26. On Distributed Program Specification and Synthesis in Architectures with Cycles  (with J. Bernet), in 26th IFIP W.G 6.1 Int. Conf. on Formal Techniques for Networked and Distributed Systems (FORTE), LNCS 4229, pp 175-190, 2006 (hal)  (pdf).

  27. Automata on Directed Graphs: Edge Versus Vertex Marking  (with D. Berwanger), in Graph Transformations, LNCS 4128, pp 46-60, 2006 (hal)  (pdf).

  28. Tree Automata and Discrete Distributed Games  (with J. Bernet), in Foundation of Computing Theory (FCT), LNCS 3623, pp 540-551, 2005 (hal)  (pdf).

  29. On the bisimulation invariant fragment of Monadic $\Sigma_1$ in the finite  (with A. Dawar), in Found. of Soft. tech and Theor. Comp. Science (FSTTCS), LNCS 3328, pp 224-237, 2004.

  30. Relating Levels of the Mu-calculus Hierarchy and Levels of the Monadic Hierarchy  (with G. Lenzi), in IEEE Symp. on Logic in Computer Science (LICS), pp 347-356, 2001 (hal)  (pdf).

  31. A toolkit for first order extension of monadic games  (with J. Marcinkowski), in Symp. on Theor. Aspects of Computer Science (STACS), LNCS 2010, 2001.

  32. On the structure of the monadic logic of the binary tree  (with G. Lenzi), in Mathematical Found. of Comp. Science (MFCS), LNCS 1672, pp 310-320, 1999 (hal)  (pdf).

  33. Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete lattices, in IEEE Symp. on Logic in Computer Science (LICS), pp 172-182, 1997.

  34. When the satisfiability problem for fixpoint expressions in complete ordered sets is simple, in Computer Science Logic (CSL), 1997.

  35. On the expressive completeness of the modal mu-calculus with respect to monadic second order logic  (with I. Walukiewicz), in Conf. on Concurrency Theory (CONCUR), LNCS 1119, pp 263-277, 1996.

  36. Automata for the modal mu-calculus and related results  (with I. Walukiewicz), in Mathematical Found. of Comp. Science (MFCS), LNCS 969, 1995.


Report


  1. From out-of-time design to in-time production of temporal media  (with P. Hudak), , LaBRI, Université de Bordeaux, 2015  (url) .

  2. Free inverse monoids up to rewriting, , LaBRI, Université de Bordeaux, 2015  (url) .

  3. Quasi-inverse monoids (and premorphisms), RR-1459-12, LaBRI, Université de Bordeaux, 2012  (url) .