TU-Logo

Logic and Algebra in Concurrency

Dresden, September 13-16, 2000 (Wednesday - Saturday)


The goal of this workshop is to highlight applications of algebra and logic, like semigroup theory, predicate logic or temporal logics, in the area of concurrency in theoretical computer science.

Interested participants are most welcome.

Program:

 
Wednesday, Sep 13
  9:00-10:00 W. Penczek (Warsaw) Efficient methods for model checking of concurrent real-time systems
10:40-11:40 A. Muscholl (Paris) Compositionality issues on HMSCs
Lunch
13:10-14:10 J.G. Henriksen (Aarhus) Towards a theory of regular MSC languages
14:50-15:20 R. Kummetz (Dresden) Traces and Topology: An Abstract Point of View
15:40-16:10 R. Borgschulze (Dresden) Logical Definability of Recognizable Languages in Concurrent Automata
 
Thursday, Sep 14
  9:00-10:00 A. Petit (Cachan) Updatable timed automata
10:40-11:40 D. Thérien (Montreal) The polynomial length property for programs over finite monoids
Lunch
13:10-14:10 W. Thomas (Aachen) Automata and the composition method: Two alternatives for the analysis of monadic theories
14:30-15:30 O. Carton (Marne la Vallée)    Algebraic methods for infinite objects
16:10-16:40 D. Kuske (Dresden) Traces are useful to reason on regular MSC-languages
Research
 
Friday, Sep 15
  9:00-10:00 V. Diekert (Stuttgart) On equations in graph groups
10:40-11:40 P. Gastin (Paris) YAL2A: Yet Another LTL to Automata translator
Lunch
13:10-14:10 D. Peled (Bell Labs, USA) Black box checking
14:30-15:00 R. Morin (Dresden) Recognizability = Definability + Boundedness for local (Mazurkiewicz) trace languages   
15:40-16:10 M. Droste (Dresden) On aperiodic and star-free formal power series in partially commuting variables
16:30-17:00 D. Kirsten (Dresden) Decidability Equivalence between the Star Problem and the FPP in Trace Monoids
 
Saturday, Sep 16
  9:00-10:00 I. Walukiewicz (Warsaw) Local logics for traces: expressibility and complexity
10:40-11:40 K. Lodaya (Chennai, India) A non-monoidal view of Petri nets
Lunch
Research

The lectures will take place in Willersbau, Zellescher Weg 12-14, room A 124 (at the Department of Mathematics).

Links:

Submissions:

The Journal of Automata, Languages and Combinatorics (JALC) has agreed to publish a special issue on this topic.
Submissions related to this topic could be either survey articles or research papers and will be refereed as usual.

Participation in the above workshop is encouraged, but is not a prerequisite for a submission.

Authors are asked to submit preferably a PostScript file (or else manuscripts in triplicate) to either of the editors of the special issue:

Manfred Droste, Institut für Algebra, TU Dresden, D-01062 Dresden,
e-mail: droste@math.tu-dresden.de
Paul Gastin, LIAFA, Université Paris 7, 2 place Jussieu, F-75251 Paris Cedex 05,
e-mail: Paul.Gastin@liafa.jussieu.fr


Deadline for submissions: Oct 31, 2000. We intend to ensure a quick refereeing process.

Authors of published papers will be provided with 20 reprints free of charge.

Other Events:

This workshop precedes the annual meeting of the German Mathematical Society (DMV), held in Dresden from Sep 18-22. For information see http://www.math.tu-dresden.de/DMV2000.
Also note the "Colloquium Logicum 2000" in Dresden, Sep 22-24, 2000.

This workshop will be supported by:

Manfred Droste, Institut für Algebra,
Technische Universität Dresden, D-01062 Dresden, Germany,
Tel. +49 351 463 3908, Fax +49 351 463 4235, droste@math.tu-dresden.de

(September 15, 2000/dk)