Advertisement

Communication with concurrent systems via I/0-procedures

  • Lutz Priese
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)

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.

Keywords

Equivalence Relation State Machine Free Choice Concurrent System Marked Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Best, E.: Fairness and Conspiracies. Information Processing Letters 18 (1984), 215–220Google Scholar
  2. [2]
    Brüggemann, A./Priese, L./Rödding, O./Schätz, R.: Modular Decomposition of Automata. LNCS 171 (1984), 198–236Google Scholar
  3. [3]
    Costa, G./Stirling, C.: A Fair Calculus of Communicating Systems. Acta Inf. 21 (1984), 417–441Google Scholar
  4. [4]
    Darondeau, P.: About Fair Asynchrony. TCS 37 (1985), 305–336Google Scholar
  5. [5]
    Dayan, I./Harel, D.: Fair Termination with Cruel Schedulers. Fundam. Inf. IX (1986), 1–12Google Scholar
  6. [6]
    Hack, M.: Petri Net Languages. Comp. Struct. Group Memo 124, MIT, Project MAC, Cambridge, Mass. (1975)Google Scholar
  7. [7]
    Hennessy, M./de Nicola, R.: Testing Equivalences for Processors. TCS 34 (1984), 83–133Google Scholar
  8. [8]
    Hennessy, H./Milner, R.: On Observing Nondeterminism and Concurrency. LNCS 85 (1980), 299–309Google Scholar
  9. [9]
    Hennessy, H./Plotkin, G.: A Term Modell for CCS. LNCS 88 (1980), 261–273Google Scholar
  10. [10]
    Hoare, C.A.R.: Communicating Sequential Processes. Comm. ACM 21 (1978), 666–677Google Scholar
  11. [11]
    Koerber, P.: Untersuchungen an sequentiellen, durch normierte Konstruktionen gewonnenen, Netzwerken endlicher Automaten. Ph.D. Thesis, Universität Münster (1976)Google Scholar
  12. [12]
    Lehmann, P./Puneli, A./Stavi, J.: Impartiality, Justice and Fairness. LNCS 115 (1981), 264–277Google Scholar
  13. [13]
    Milner, R.: Calculi for Synchrony and Asynchrony. TCS 25 (1983), 267–310Google Scholar
  14. [14]
    Milner, R.: A Calculus of Communicating Systems. LNCS 92 (1980)Google Scholar
  15. [15]
    Ottmann, T.: Some Classes of Nets of Finite Automata. Institut Angew. Informatik, Karlsruhe, Bericht 29 (1975)Google Scholar
  16. [16]
    Park, D.: Concurrency and Automata on Infinite Sequences. LNCS 104 (1984)Google Scholar
  17. [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. [18]
    Peterson, J.L.: Petri Net Theory and the Modelling of Systems. Prentice Hall, N.J. (1981)Google Scholar
  19. [19]
    Petri, C.A.: Kommunikation mit Automaten. Schriften des IIM 2, Bonn (1962)Google Scholar
  20. [20]
    Priese, L.: Automata and Concurrency. TCS 25 (1983), 221–265Google Scholar
  21. [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. [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. [23]
    Priese, L./Willecke-Klemme, U.: On Models for Concurrent Computation. To appearGoogle Scholar
  24. [24]
    Queille, J.P./Sifakis, J.: Fairness and related Properties in Transition Systems. Acta Inf. 19 (1983), 195–220Google Scholar
  25. [25]
    Reisig, W.: Petrinetze. Springer Verlag (1982)Google Scholar
  26. [26]
    Rödding, D./Rödding, W.: Networks of Finite Automata. In: Progress in Cybernetics and Systems Research, Hemisphere, Washington (1979)Google Scholar
  27. [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. [28]
    Starke, P.: Abstrakte Automaten. VEB, Deutscher Verlag der Wissenschaften, DDR, Berlin (1969)Google Scholar
  29. [29]
    Starke, P.: Petrinetze, VEB, Deutscher Verlag der Wissenschaften, DDR, Berlin (1980)Google Scholar
  30. [30]
    Vobl, R.: Komplexitätsuntersuchungen an Basisdarstellungen endlicher Automaten. Diplomarbeit, Universität Münster (1980)Google Scholar
  31. [31]
    Voss, K.: On the Notion of Interface in Condition/Event-Systems. Informatik Fachbe.ps 12richte66(1983),278–291.ps 11Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Lutz Priese
    • 1
  1. 1.Fachbereich Mathematik-InformatikUniversität-Gesamthochschule PaderbornBundesrepublik Deutschland

Personalised recommendations