The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |