| 2008 |
|---|
| 18 | EE | Julien Bernet,
David Janin:
From Asynchronous to Synchronous Specifications for Distributed Program Synthesis.
SOFSEM 2008: 162-173 |
| 2007 |
|---|
| 17 | EE | David Janin:
On the (High) Undecidability of Distributed Synthesis Problems.
SOFSEM (1) 2007: 320-329 |
| 16 | EE | Anuj Dawar,
David Janin:
The monadic theory of finite representations of infinite words.
Inf. Process. Lett. 103(3): 94-101 (2007) |
| 2006 |
|---|
| 15 | EE | Julien Bernet,
David Janin:
On Distributed Program Specification and Synthesis in Architectures with Cycles.
FORTE 2006: 175-190 |
| 14 | EE | Dietmar Berwanger,
David Janin:
Automata on Directed Graphs: Edge Versus Vertex Marking.
ICGT 2006: 46-60 |
| 2005 |
|---|
| 13 | EE | Julien Bernet,
David Janin:
Tree Automata and Discrete Distributed Games.
FCT 2005: 540-551 |
| 2004 |
|---|
| 12 | EE | Anuj Dawar,
David Janin:
On the Bisimulation Invariant Fragment of Monadic S1 in the Finite.
FSTTCS 2004: 224-236 |
| 11 | EE | Bruno Courcelle,
David Janin:
Workshop on Logic, Graph Transformations, Finite and Infinite Structures.
ICGT 2004: 448-450 |
| 10 | EE | David Janin,
Giacomo Lenzi:
On the Rlationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus.
Fundam. Inform. 61(3-4): 247-265 (2004) |
| 2002 |
|---|
| 9 | | David Janin,
Giacomo Lenzi:
On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees.
Computers and Artificial Intelligence 21(3): (2002) |
| 8 | EE | Julien Bernet,
David Janin,
Igor Walukiewicz:
Permissive strategies: from parity games to safety games.
ITA 36(3): 261-275 (2002) |
| 2001 |
|---|
| 7 | | David Janin,
Giacomo Lenzi:
Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy.
LICS 2001: 347-356 |
| 6 | EE | David Janin,
Jerzy Marcinkowski:
A Toolkit for First Order Extensions of Monadic Games.
STACS 2001: 353-364 |
| 1999 |
|---|
| 5 | | David Janin,
Giacomo Lenzi:
On the Structure of the Monadic Logic of the Binary Tree.
MFCS 1999: 310-320 |
| 1997 |
|---|
| 4 | EE | David Janin:
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices.
LICS 1997: 172-182 |
| 1996 |
|---|
| 3 | | David Janin,
Igor Walukiewicz:
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic.
CONCUR 1996: 263-277 |
| 1995 |
|---|
| 2 | | David Janin,
Igor Walukiewicz:
Automata for the Modal mu-Calculus and related Results.
MFCS 1995: 552-562 |
| 1993 |
|---|
| 1 | | David Janin:
Some Results About Logical Descriptions of Non-Deterministic Behaviours.
FSTTCS 1993: 338-347 |
