Follow
David Janin
David Janin
CNRS LaBRI, Bordeaux INP, Université de Bordeaux, France
Verified email at labri.fr - Homepage
Title
Cited by
Cited by
Year
On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
D Janin, I Walukiewicz
International Conference on Concurrency Theory (CONCUR), 263-277, 1996
4531996
Automata for the modal μ-calculus and related results
D Janin, I Walukiewicz
Mathematical Foundations of computer science (MFCS), 552-562, 1995
3011995
Permissive strategies: from parity games to safety games
J Bernet, D Janin, I Walukiewicz
Theoretical informatics and applications (Rairo) 36, 261-275, 2002
1262002
Vers une modélisation combinatoire des structures rythmiques simples en musique
D Janin
Revue Francophone d'Informatique Musicale (RFIM) 2, 2012
33*2012
The T-Calculus: towards a structured programing of (musical) time and space
D Janin, F Berthaud, M DeSainte-Catherine, Y Orlarey, S Salvati
ACM Workshop on Functional Art, Music, Modeling and Design (FARM 2013), 2013
282013
Advanced synchronization of audio or symbolic musical patterns: an algebraic approach
F Berthaut, D Janin, B Martin
Sixth IEEE International Conference on Semantic Computing (ICSC 2012), 202-209, 2012
272012
Tiled polymorphic temporal media
P Hudak, D Janin
ACM Workshop on Functional Art, Music, Modeling and Design (FARM), 2014
252014
On languages of one-dimensional overlapping tiles
D Janin
39th International Conference on Current Trends in Theory and Practice of …, 2013
222013
Relating levels of the mu-calculus hierarchy and levels of the monadic hierarchy
D Janin, G Lenzi
16th Annual IEEE Symposium on Logic in Computer Science (LICS), 347-356, 2001
222001
Multi-scale design of interactive music systems: the libTuiles experiment
D Janin, F Berthaut, M Desainte-Catherine
Sound and Music Computation (SMC 2013), 123 -- 129, 2013
212013
Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles
D Janin
37th International Symposium on Mathematical Foundations of Computer Science …, 2012
212012
On the (high) undecidability of distributed synthesis problems
D Janin
International Conference on Current Trends in Theory and Practice of …, 2007
212007
On the Relationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus
D Janin, G Lenzi
Fundamenta Informaticae 61 (3), 247-265, 2004
202004
Overlapping tile automata
D Janin
8th International Computer Science Symposium in Russia (CSR), 431--443, 2013
172013
Algebras, automata and logic for languages of labeled birooted trees
D Janin
40th International Colloquium on Automata, Languages and Programming (ICALP …, 2013
162013
A toolkit for first order extensions of monadic games
D Janin, J Marcinkowski
Symposium on Theoretical Aspects of Computer Science (STACS), 353-364, 2001
162001
On quasi-inverse monoids (and premorphisms)
D Janin
152012
Propriétés logiques du non déterminisme et mu-calcul modal
D Janin
LaBRI, Université de Bordeaux I, France, 1996
15*1996
On the logical definability of topologically closed recognizable languages of infinite trees
D Janin, G Lenzi
Computing and Informatics 21, 185--203, 2002
142002
Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete lattices
D Janin
12th Annual IEEE Symposium on Logic in Computer Science (LICS), 172-182, 1997
141997
The system can't perform the operation now. Try again later.
Articles 1–20