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/2012/newsitem/4254/29- June-2012-Workshop-on-Algorithmics-of-Infinite-Sta te-Systems-AISS-Dubrovnik-Croatia DTSTAMP:20111230T000000 SUMMARY:Workshop on Algorithmics of Infinite State Systems (AISS), Dubrovnik, Croatia DTSTART;VALUE=DATE:20120629 DTEND;VALUE=DATE:20120629 LOCATION:Dubrovnik, Croatia DESCRIPTION:This satellite workshop of LICS-2012 p rovides the opportunity to assess recent scientifi c advances and exchange ideas on the algorithmic t heory of infinite state systems. Infinite state sy stems arise in many areas of computer science. Typ ical examples are recursive programs, communicatin g systems with unbounded buffers, and real time sy stems. Important algorithmic techniques dealing wi th infinite state systems include model checking, reachability and equivalence checking. For more information, see http://www.informatik.uni-bremen. de/~goeller/AISS12 We invite submissions on the w orkshop topics. We do not plan to have a published proceedings or special issue for a journal. Theor efore, already published recent work is welcome to o. Submission deadline is March 20th, 2012. X-ALT-DESC;FMTTYPE=text/html:
This satellite workshop of LICS-2012 provides the oppor tunity\n to assess recent scientific advances and exchange ideas on the\n algorithmic theo ry of infinite state systems. Infinite state\n systems arise in many areas of computer science. Typical\n examples are recursive programs, c ommunicating systems with\n unbounded buffers , and real time systems. Important algorithmic\n techniques dealing with infinite state system s include model\n checking, reachability and equivalence checking.\n
\n \n \nFor more information, see\n http://www.informatik.uni-bre men.de/~goeller/AISS12\n
We invite submissions on the workshop to pics.\n We do not plan to have a published proceedings or special issue\n for a journa l. Theorefore, already published recent work is\n welcome too.\n Submission deadline i s March 20th, 2012.\n
\n