Skip to main content
SpringerLink
Log in

Communication with concurrent systems via I/0-procedures

  • Chapter
  • First Online:
Computation Theory and Logic

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

  • 127 Accesses

Abstract

Communication oriented semantics for concurrent systems are studied with the assumption that two systems of "equal behaviour" with respect to the abstract semantic should be able to replace each other in technical systems.

This research was supported by a grant of the DFG

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.

References

  1. Best, E.: Fairness and Conspiracies. Information Processing Letters 18 (1984), 215–220

    Google Scholar 

  2. Brüggemann, A./Priese, L./Rödding, O./Schätz, R.: Modular Decomposition of Automata. LNCS 171 (1984), 198–236

    Google Scholar 

  3. Costa, G./Stirling, C.: A Fair Calculus of Communicating Systems. Acta Inf. 21 (1984), 417–441

    Google Scholar 

  4. Darondeau, P.: About Fair Asynchrony. TCS 37 (1985), 305–336

    Google Scholar 

  5. Dayan, I./Harel, D.: Fair Termination with Cruel Schedulers. Fundam. Inf. IX (1986), 1–12

    Google Scholar 

  6. Hack, M.: Petri Net Languages. Comp. Struct. Group Memo 124, MIT, Project MAC, Cambridge, Mass. (1975)

    Google Scholar 

  7. Hennessy, M./de Nicola, R.: Testing Equivalences for Processors. TCS 34 (1984), 83–133

    Google Scholar 

  8. Hennessy, H./Milner, R.: On Observing Nondeterminism and Concurrency. LNCS 85 (1980), 299–309

    Google Scholar 

  9. Hennessy, H./Plotkin, G.: A Term Modell for CCS. LNCS 88 (1980), 261–273

    Google Scholar 

  10. Hoare, C.A.R.: Communicating Sequential Processes. Comm. ACM 21 (1978), 666–677

    Google Scholar 

  11. Koerber, P.: Untersuchungen an sequentiellen, durch normierte Konstruktionen gewonnenen, Netzwerken endlicher Automaten. Ph.D. Thesis, Universität Münster (1976)

    Google Scholar 

  12. Lehmann, P./Puneli, A./Stavi, J.: Impartiality, Justice and Fairness. LNCS 115 (1981), 264–277

    Google Scholar 

  13. Milner, R.: Calculi for Synchrony and Asynchrony. TCS 25 (1983), 267–310

    Google Scholar 

  14. Milner, R.: A Calculus of Communicating Systems. LNCS 92 (1980)

    Google Scholar 

  15. Ottmann, T.: Some Classes of Nets of Finite Automata. Institut Angew. Informatik, Karlsruhe, Bericht 29 (1975)

    Google Scholar 

  16. Park, D.: Concurrency and Automata on Infinite Sequences. LNCS 104 (1984)

    Google Scholar 

  17. Patil, S.: Limitations and Capabilities of Dijkstra's Semaphore Primitives for Coordination among Processes. Comp. Struct. Group Memo 57, MIT, Project MAC, Cambridge, Mass. (1971)

    Google Scholar 

  18. Peterson, J.L.: Petri Net Theory and the Modelling of Systems. Prentice Hall, N.J. (1981)

    Google Scholar 

  19. Petri, C.A.: Kommunikation mit Automaten. Schriften des IIM 2, Bonn (1962)

    Google Scholar 

  20. Priese, L.: Automata and Concurrency. TCS 25 (1983), 221–265

    Google Scholar 

  21. Priese, L./Rehrmann, R./Willecke-Klemme, U.: Some Results on Fairness: The Regular Case. To appear in Proc. STACS '87, LNCS (1987)

    Google Scholar 

  22. Priese, L./Willecke-Klemme, U.: On State Equivalence Relations in Nondeterministic or Concurrent Systems. Reihe Theoretische Informatik, Bericht 34, Universität-Gesamthochschule Paderborn (1986)

    Google Scholar 

  23. Priese, L./Willecke-Klemme, U.: On Models for Concurrent Computation. To appear

    Google Scholar 

  24. Queille, J.P./Sifakis, J.: Fairness and related Properties in Transition Systems. Acta Inf. 19 (1983), 195–220

    Google Scholar 

  25. Reisig, W.: Petrinetze. Springer Verlag (1982)

    Google Scholar 

  26. Rödding, D./Rödding, W.: Networks of Finite Automata. In: Progress in Cybernetics and Systems Research, Hemisphere, Washington (1979)

    Google Scholar 

  27. Rosier, L.E./Yen, Hsu-Chun: Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning ω-Machines. University of Texas., Dept. of Comp. Sci., Austin, Technical Report 85-08 (1985)

    Google Scholar 

  28. Starke, P.: Abstrakte Automaten. VEB, Deutscher Verlag der Wissenschaften, DDR, Berlin (1969)

    Google Scholar 

  29. Starke, P.: Petrinetze, VEB, Deutscher Verlag der Wissenschaften, DDR, Berlin (1980)

    Google Scholar 

  30. Vobl, R.: Komplexitätsuntersuchungen an Basisdarstellungen endlicher Automaten. Diplomarbeit, Universität Münster (1980)

    Google Scholar 

  31. Voss, K.: On the Notion of Interface in Condition/Event-Systems. Informatik Fachbe.ps 12richte66(1983),278–291.ps 11

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik-Informatik, Universität-Gesamthochschule Paderborn, Bundesrepublik Deutschland

    Lutz Priese

Authors
  1. Lutz Priese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Priese, L. (1987). Communication with concurrent systems via I/0-procedures. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_174

Download citation

  • DOI: https://doi.org/10.1007/3-540-18170-9_174

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation