From - Mon Mar 10 23:06:58 1997
Path: Radon.Stanford.EDU!news.Stanford.EDU!su-news-hub1.bbnplanet.com!cpk-news-hub1.bbnplanet.com!news.bbnplanet.com!feed1.news.erols.com!newsfeeds.sol.net!nntp.uio.no!funny.bahnhof.se!newsfeed.tip.net!news.seinf.abb.se!news.mdh.se!columba.udac.uu.se!fm
From: fm@csd.uu.se (Faron Moller)
Newsgroups: comp.theory
Subject: INFINITY'97 -- Final Call For Papers
Date: 8 Mar 1997 11:41:19 GMT
Organization: Computing Science Dept., Uppsala University, Sweden.
Lines: 69
Distribution: inet
Message-ID: <5frj8v$1f5c@columba.udac.uu.se>
NNTP-Posting-Host: sandra.csd.uu.se
Originator: fm@sandra

                  * * *  FINAL CALL FOR ABSTRACTS  * * *

                    * * *   Deadline: 15 March   * * *


              ***********************************************
CALL          *                 Infinity'97                 *           CALL
FOR           *        2nd International Workshop on        *            FOR
PAPERS        *   Verification of Infinite State Systems    *         PAPERS
              ***********************************************

                               Bologna, Italy
                              July 11-12, 1997

                     (A Satellite Workshop to ICALP'97)

The study of infinite state systems has received a concerted effort within
the Concurrency Theory community over the past few years. The basis of this
effort has been the realization that an understanding of infinite state
systems is necessary in order to have a complete picture of general process
algebras, Petri nets, or other formalisms incorporating value-passing,
real-time, hybrid, and/or probabilistic aspects. Its importance has grown
however by the further realization that techniques which are developed for
infinite state systems - particularly structural techniques - can
potentially provide elegant solutions to the state-space explosion problem
in the analysis of finite state systems, as well as to classical problems in
language theory.

The aim of this workshop is to provide a forum for researchers interested in
the development of mathematical techniques for the analysis of infinite
state systems. Topics of particular interest include: decidablility issues
for equivalence and model checking over various classes of infinite state
systems; complexity results for decidability results; connections and
applications to questions in classical automata and formal language theory;
and tools and case studies involving nontrivial applications of methods for
the analysis of infinite state systems.


SUBMISSIONS:
~~~~~~~~~~~
Authors are invited to submit a 5-page extended abstract to the Programme
Chair:

                        Faron Moller (fm@csd.uu.se)
              Computing Science Department, Uppsala University
                          S-751 05 Uppsala, SWEDEN

The submission should be emailed in postscript format BEFORE March 15, 1997.
The programme committee will select the most appropriate abstracts for
presentation during the worskhop and make their decisions known by April 15,
1997.

PROCEEDINGS:
~~~~~~~~~~~
The selected abstracts will be compiled into an informal proceedings in the
form of an Uppsala University Research Report for distribution at the
workshop, and final papers will likely be reviewed for publication in
Electronic Notes in Theoretical Computer Science.

PROGRAM COMMITTEE:
~~~~~~~~~~~~~~~~~
   Ahmed Bouajjani   Grenoble             Tom Henzinger     Berkeley
   Julian Bradfield  Edinburgh            Kim Larsen        Aalborg
   Didier Caucal     Rennes               Faron Moller      Uppsala (chair)
   Karel Culik II    South Carolina       Bernhard Steffen  Passau

PROGRAM COMMITTEE:  As with ICALP'97, Roberto Gorrieri (I), chairman.