Modular decomposition of automata

  • Anne Brüggemann
  • Lutz Priese
  • Dieter Rödding
  • Rüdiger Schätz
Section III: Automata And Machines
Part of the Lecture Notes in Computer Science book series (LNCS, volume 171)


This paper deals with some aspects of Normed Networks (NN) and Asynchronous Parallel Automata nets (APA). A NN is a canonical composition of sequential machines and NN theory deals thus with the classical theory of sequential computation. An APA net is also a straightforward composition of concurrent automata and APA net theory thus handles asynchronous parallel computations. APA nets are very closely related to Vector Addition Systems but allow only local conflicts within the component machines while the network structure is a modular one and thus conflict-free. As a main aspect the paper asks for optimal realisations of sequential automata by NN and APA nets, respectively.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [Brkl 83]
    Brüggemann, A./Klein, R.: Über die Minimalität von {K,F,D}. Arbeitspapier Nr. 8, Inst. f. Math. Logik u. Grundlagenforschung, Münster (1983)Google Scholar
  2. [Ke 74]
    Keller, R.M.: Towards a Theory of Universal Speed-Independent Modules, IEEE Transactions on Computers, Vol. C-23, No. 1, Jan. 1974Google Scholar
  3. [Kö 76]
    Körber, P.: Untersuchungen an sequentiellen, durch normierte Konstruktionen gewonnenen Netzwerken endlicher Automaten. Dissertation, Inst. f. Math. Logik u. Grundlagenforschung, Münster (1976)Google Scholar
  4. [Ott 73]
    Ottmann, Th.: über Möglichkeiten zur Simulation endlicher Automaten durch eine Art sequentieller Netzwerke aus einfachen Bausteinen. ZmLG 19 (1973)Google Scholar
  5. [PrRö 74]
    Priese, L./Rödding, D.: A Combinatorial Approach to Self-Correction. J. Cybern. 4 (1974)Google Scholar
  6. [Pr 83]
    Priese, L.: Automata and Concurrency. TCS, Vol. 25, Number 3, July 1983Google Scholar
  7. [Rö 83]
    Rödding, D.: Modular Decomposition of Automata (Survey). in: Karpinski, M. (ed.): Proceedings of the 1983 International FCT-Conference, LNCS 158Google Scholar
  8. [Vo 80]
    Vobl, R.: Komplexitätsuntersuchungen an Basisdarstellungen endlicher Automaten. Diplomarbeit, Inst. f. Math. Logik u. Grundlagenforschung, Münster (1980)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Anne Brüggemann
    • 2
  • Lutz Priese
    • 1
  • Dieter Rödding
    • 2
  • Rüdiger Schätz
    • 2
  1. 1.Fachbereich Mathematik-InformatikPaderborn
  2. 2.Institut für Mathematische Logik und GrundlagenforschungMünster

Personalised recommendations