TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 9302

Automata Theory: Distributed Models

( Jan 11 – Jan 15, 1993 )

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/9302

Organizers
  • A. Arnold
  • L. Priese
  • R. Vollmar



Summary

This meeting was the third one in a series of automata theory seminars in January at Schloß Dagstuhl. Its specific theme was on "distributed models". To distinguish this meeting from others on semantics of parallelism or on distributed algorithms a concentration on the interplay of automata concepts and distributed computations was intended. Thus several researchs on the main interconnections, namely cellular automata, Petri-nets, and asynchronous automata and traces as their languages, have been invited. Nevertheless, also some lectures on further topics, such as tree-like automata, dataflow networks, domain-theoretic semantics for principles of distributed computations, etc., have been welcome.

The talks of Koiran, Mauri, Mazoyer, Umeo, Vollmar and Worsch covered the centre of cellular automata theory, while Thomas' talk on acceptors over graphs and pictures connected cellular automata with distributed automata over graphs and trees. Also Gruska contributed to automata over modified trees. The lectures of Best and Esparza came from the theory of Petri nets, Priese connected Petri nets and concurrent automata, whilst Starke presented a talk on applied Petri nets. Kwiatkowska started to research some important aspects of concurrent computations (liveness and fairness) with domain-theoretical methods. The talk of Burkhard on multi agents presented basic considerations for distributed models. The same holds for the talks of Arnold on transition systems and of Brzozowski on asynchronous networks. Rabinovitch dealt with dataflow networks. Asynchronous automata have been covered by Diekert, Muscholl, Pighizzini and Zielonka, and their languages, traces, by Badouel, Darondeau, Gastin, Petit and Rozoy.

Only one talk doesn't fit into this concept, namely Kleine Büning's lecture on a new combinatorial equation for trees. However, as this problem was solved in the evenings of our Dagstuhl seminar by Arnold and Kleine Büning in long discussions, we encouraged him to change his lecture into this actual stuff.

As it was one idea of the organizers to connect the main streams, cellular automata, Petri-nets, and asynchronous automata, the lectures had been mixed in order not to have a "trace-day", e.g. The following programm shows the chosen order and the abstracts are ordered as in this programme. Thanks to Anca Muscholl, who organized the Dagstuhl-Seminar-Report.

Copyright

Participants
  • A. Arnold
  • L. Priese
  • R. Vollmar