BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2008/newsitem/2354/28-
29-May-2008-ABCDmu-Calculus-AutoMathA-Brainstormin
g-and-Cooperation-Days-on-Mu-Calculus-Lausanne-Swi
tzerland
DTSTAMP:20080515T000000
SUMMARY:ABCDmu-Calculus (AutoMathA Brainstorming a
nd Cooperation Days on Mu-Calculus), Lausanne, Sw
itzerland
DTSTART;VALUE=DATE:20080528
DTEND;VALUE=DATE:20080529
LOCATION:Lausanne, Switzerland
DESCRIPTION:As a mathematical framework to reason
about fixpoints in modal logic, the modal \\mu-cal
culus constitutes a meta formal system for many lo
gics used in computer science. It is indeed weaker
than second order logics, but sustains enough exp
ressibility for many applications, in particular i
n program synthesis and verification. It is strong
ly connected with the theory of automata, since mo
dal \\mu-calculus is in fact equivalent to alterna
ting tree automata. Modal \\mu-calculus forms a re
search field of considerable interest, because of
the richness of its powerful, although simple, mat
hematical theory which establishes deep connection
s with logic, algebra, automata, and game theory.
If the connection with the theory of automata an
d games, has been intensively studied, many questi
ons remain open. For instance the precise complexi
ty - or even the understanding - of modal \\mu-cal
culus formulas is in many cases a total mystery. N
ot to mention that most decidability questions rel
ated to alternating tree automata are unanswered y
et. The aim of this scientific meeting is to bring
together researchers from various countries and b
ackground to work together for 2 days on \\mu-calc
ulus and automata. Registration deadline: May 20
, 2008 Further information about ABCD on Mu-Calcul
us can be obtained at http://www2.unil.ch/logique/
ABCDmu-calculus08/. E-mail enquiries about this mi
ni-workshop should be directed to alessandro.facch
ini at unil.ch
X-ALT-DESC;FMTTYPE=text/html:\n As a mathe
matical framework to reason about fixpoints in\n
modal logic, the modal \\mu-calculus constitut
es a meta formal\n system for many logics use
d in computer science. It is indeed\n weaker
than second order logics, but sustains enough\n
expressibility for many applications, in partic
ular in program\n synthesis and verification.
It is strongly connected with the\n theory o
f automata, since modal \\mu-calculus is in fact\n
equivalent to alternating tree automata. Mod
al \\mu-calculus\n forms a research field of
considerable interest, because of the\n richn
ess of its powerful, although simple, mathematical
theory\n which establishes deep connections
with logic, algebra,\n automata, and game the
ory.\n

\n If the connection with
the theory of automata and games, has\n been
intensively studied, many questions remain open. F
or\n instance the precise complexity - or eve
n the understanding - of\n modal \\mu-calculu
s formulas is in many cases a total\n mystery
. Not to mention that most decidability questions
related\n to alternating tree automata are un
answered yet. The aim of this\n scientific me
eting is to bring together researchers from variou
s\n countries and background to work together
for 2 days on\n \\mu-calculus and automata.\
n

\n \n Registration deadline:
May 20, 2008\n Further information about A
BCD on Mu-Calculus can be obtained at \n http://www2.unil.ch/logique/A
BCDmu-calculus08/.\n E-mail enquiries a
bout this mini-workshop should be directed to \n
alessandro.facchini at unil.ch \n

\n
URL:/NewsandEvents/Archives/2008/newsitem/2354/28-
29-May-2008-ABCDmu-Calculus-AutoMathA-Brainstormin
g-and-Cooperation-Days-on-Mu-Calculus-Lausanne-Swi
tzerland
END:VEVENT
END:VCALENDAR