Skip to main content
SpringerLink
Log in

Modular decomposition of automata

  • Section III: Automata And Machines
  • Conference paper
  • First Online:
Logic and Machines: Decision Problems and Complexity (LaM 1983)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 171))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. 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. Keller, R.M.: Towards a Theory of Universal Speed-Independent Modules, IEEE Transactions on Computers, Vol. C-23, No. 1, Jan. 1974

    Google Scholar 

  3. 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. Ottmann, Th.: über Möglichkeiten zur Simulation endlicher Automaten durch eine Art sequentieller Netzwerke aus einfachen Bausteinen. ZmLG 19 (1973)

    Google Scholar 

  5. Priese, L./Rödding, D.: A Combinatorial Approach to Self-Correction. J. Cybern. 4 (1974)

    Google Scholar 

  6. Priese, L.: Automata and Concurrency. TCS, Vol. 25, Number 3, July 1983

    Google Scholar 

  7. Rödding, D.: Modular Decomposition of Automata (Survey). in: Karpinski, M. (ed.): Proceedings of the 1983 International FCT-Conference, LNCS 158

    Google Scholar 

  8. Vobl, R.: Komplexitätsuntersuchungen an Basisdarstellungen endlicher Automaten. Diplomarbeit, Inst. f. Math. Logik u. Grundlagenforschung, Münster (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik-Informatik, Warburger Straße 100, D-4790, Paderborn

    Lutz Priese

  2. Institut für Mathematische Logik und Grundlagenforschung, Einsteinstraße 62, D-4400, Münster

    Anne Brüggemann, Dieter Rödding & Rüdiger Schätz

Authors
  1. Anne Brüggemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lutz Priese
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dieter Rödding
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rüdiger Schätz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brüggemann, A., Priese, L., Rödding, D., Schätz, R. (1984). Modular decomposition of automata. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

  • Online ISBN: 978-3-540-38856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation