The INFINITY 2002 Programme

8:55 Opening

Invited talk.
9:00 - 9:50 Colin Stirling. DPDA equivalence and harder problems.

9:50 - 10:00 Break.

Regular papers I.
10:00 - 10:25 H. Huttel. Deciding framed bisimilarity.
10:25 - 10:50 J. Stribrna, I. Cerna. Some remarks on weak bisimilarity of BPA-processes.

10:50 - 11:00 Break.

Regular papers II.
11:00 - 11:25 T. Colcombet. Rewriting in the partial algebra of typed terms modulo ACI.
11:25 - 11:50 C. Rispal. The synchronized graphs trace the context-sensitive languages.
11:50 - 12:15 T. Urvoy. Abstract families of graphs.

12:15 - 14:00 Lunch.

Regular papers III.
14:00 - 14:25 P. Abdulla, A. Nylen. Undecidability of LTL for timed Petri nets.
14:25 - 14:50 T. Cachat. Uniform solution of parity games on prefix-recognizable graphs.
14:50 - 15:15 A. Finkel, J.-F. Raskin, M. Samuelides, L. Van Begin. Monotonic extensions of Petri nets: Foward and backward search revisited.

15:15 - 15:30 Break.

Presentations.
15:30 - 16:00 D. Distefano, A. Rensink, J.-P. Katoen. Model checking birth and death.
16:00 - 16:30 A. Kucera, J. Strejcek. On the power of nested X and U modalities in the logic LTL.

16:30 - 16:45 Break.

16:45 - 17:15 J. Srba. Applications of the existential quantification technique.
17:15 - 17:45 P. Jancar. New results for bisimilarity on basic parallel processes.