Skip to main content

Construction of Distributed Systems from Cycle-Free Finite Automata

  • Conference paper
Applications and Theory of Petri Nets

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 66))

  • 51 Accesses

Abstract

The purpose of this paper is to introduce an algorithm to construct distributed systems from cycle-free finite automata and a partition of the input-alphabet.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brauer, W . (ed.) Net Theory and Applications Proceedings of the Advanced Course on General Net Theory of Processes and Systems Lecture Notes in Computer Science, Springer, 1979.

    Google Scholar 

  2. Eckert, H.; Prinoth, R. Ein Algorithmus zur formalen Verifikation des Dienstes von Kommunikationsprotokollen. Internal report, GMD-IFV, 1981.

    Google Scholar 

  3. Eckert, H.; Prinoth, R. Automated Proofing of Communication Protocols against Communication Services Proceedings ICCC 82 North-Holland, 1982.

    Google Scholar 

  4. Hopcroft, J.E.; Ullmann, J.D. Formal languages and their relations to automata Addison-Wesley, 1969.

    Google Scholar 

  5. Paule, C. Epsilon, Ein Programm zur Berechnung der Sprache, welche aus einer vorgegebenen regulären Sprache dadurch entsteht, daß eine beliebige Teilmenge des Eingabealphabets durch das leere Wort ersetzt wird. Internal report, GMD-IFV, 1981.

    Google Scholar 

  6. Peterson, J.L. Computation Sequence Sets Journal of Computer and System Sciences 13, 1–24, 1976.

    Article  MathSciNet  MATH  Google Scholar 

  7. Prinoth, R . Eigenschaften färbbarer Petri-Netze in: Theoretical Computer Science, 3rd GI-Conference Lecture Notes in Computer Science, Springer 1977.

    Google Scholar 

  8. Prinoth, R . Verteilungsalgorithmen für Zustandsmaschinen Internal report, GMD-IFV, 1981.

    Google Scholar 

  9. Prinoth, R . An Algorithm to construct Distributed Systems from State-Machines Proceedings of the IFIP WG 6.1 Second International Workshop on Protocol Specification, Testing and Verification; Idyllwild, California, 17–20 May, 1982 North-Holland, 1982.

    Google Scholar 

  10. Prinoth, R . Ein Algorithmus zum Verteilen, Rekonfigurieren und Modularisieren von Systemen, die als kreisfreie endliche Automaten gegeben sind. Internal report, GMD-IFV, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prinoth, R. (1983). Construction of Distributed Systems from Cycle-Free Finite Automata. In: Pagnoni, A., Rozenberg, G. (eds) Applications and Theory of Petri Nets. Informatik-Fachberichte, vol 66. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69028-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69028-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-69028-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics