Advertisement

Substitution systems — A family of system models based on concurrency

  • H. J. Genrich
  • K. Lautenbach
  • P. S. Thiagarajan
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 88)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Genrich, H.J.; Lautenbach, K.: Facts in Place/Transition-Nets. In: Mathematical Foundations of Computer Science, Ed. Winkowski, J., Lecture Notes in Computer Science 64, pp. 213–231, Berlin, Heidelberg, New York: Springer, 1978Google Scholar
  2. 2.
    Genrich, H.J.; Lautenbach, K.: The Analysis of Distributed Systems by means of Predicate/Transition-Nets. In: Semantics of Concurrent Computation, Ed. Kahn, G., Lecture Notes in Computer Science 70, pp. 109–122, Berlin, Heidelberg, New York: Springer, 1979.Google Scholar
  3. 3.
    Genrich, H.J.; Lautenbach, K.: Thiagarajan, P.S.: Elements of General Net Theory. In: Net Theory and Practice, Ed. Brauer, W., Lecture Notes in Computer Science, Berlin, Heidelberg, New York: Springer, 1979.Google Scholar
  4. 4.
    Genrich, H.J.; Thiagarajan, P.S.: Bipolar Synchronization Systems. In: Seventh International Symposium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Berlin, Heidelberg, New York: Springer, 1980Google Scholar
  5. 5.
    Hoare, C.A.R.: Communicating Sequential Processes. CACM, 21, no.8, pp. 666–677, 1978Google Scholar
  6. 6.
    Janicki, R.: A Characterization of Concurrency-like Relations. In: Semantics of Concurrent Computation, Ed. Kahn, G., Lecture Notes in Computer Science 70, pp. 109–122, Berlin, Heidelberg, New York: Springer, 1979.Google Scholar
  7. 7.
    Keller, R.M.: Formal Verification of Concurrent Programs. CACM, 19, no.7, pp.371–384, 1976.Google Scholar
  8. 8.
    Lauer, P.E.,; Shields, M.W; Best, E.: On the Design and Certification of Asynchronous Systems of Processes. Part 1: COSY — A System Specification Language Based on Paths and Processes, Report ASM 49; Part 2: Formal Theory of the Basic COSY Notation, Report 45, The University of Newcastle upon Tyne, Newcastle, 1978.Google Scholar
  9. 9.
    Lautenbach, K; Wedde, H.: Generating Control Mechanisms by Restrictions. In Mathematical Foundations of Computer Science, ed. Mazurkiewicz, A., Lecture Notes in Computer Science 45, pp. 416–422, Berlin, Heidelberg, New York: Springer, 1976Google Scholar
  10. 10.
    Maggiolo-Schettini, A.; Wedde, H.; Winkowski, J.: Modeling a Solution for a Control Problem in Distributed Systems by Restrictions. In: Semantics of Concurrent Computation, Ed. Kahn, G., Lecture Notes in Computer Science 70, Berlin, Heidelberg, New York: Springer, 1979.Google Scholar
  11. 11.
    Mazurkiewicz, A.: Concurrent Program Schemes and their Interpretation. DAIMI PB-78, Aarhus University, Aarhus, 1977.Google Scholar
  12. 12.
    Milner, R.: Algebraic Concurrency. Notes of a Course given at Aarhus University, 1979.Google Scholar
  13. 13.
    Petri, C.A.: Kommunikation mit Automaten. Bonn: Institut für Instrumentelle Mathematik, Schriften des IIM Nr. 2, 1962Google Scholar
  14. 14.
    Petri, C.A.: Concepts of Net Theory. Mathematical Foundations of Computer Science, Math. Institute of the Slovak Ac. of Sciences, 1973Google Scholar
  15. 15.
    Petri, C.A.: Interpretations of Net Theory. St.Augustin: Gesellschaft für Mathematik und Datenverarbeitung Bonn, Interner Bericht ISF-75-07 (1975)Google Scholar
  16. 16.
    Pnueli, A.: The Temporal Semantics of Concurrent Programs. In: Semantics of Concurrent Computation, Ed. Kahn, G., Lecture Notes in Computer Science 70, pp. 1–20, Berlin, Heidelberg, New York: Springer, 1979.Google Scholar
  17. 17.
    Schiffl, H.: Zuordnungsgraphen. Diplomarbeit, Universität Bonn, Bonn, 1974 (in German)Google Scholar
  18. 18.
    Sifakis, J.: Deadlocks and Livelocks in Transition Systems. In: Mathematical Foundations of Computer Science, Ed. Dembinski, P., Lecture Notes in Computer Science, Berlin, Heidelberg, New York: Springer, 1980 (this volume).Google Scholar
  19. 19.
    Thiagarajan, P.S.: Genrich, H.J.: Assignment Systems — A Model for Asynchronous Computations. ISF-Report 76.10, St.Augustin: Gesellschaft für Mathematik und Datenverarbeitung, 1976Google Scholar
  20. 20.
    Wedde, H.: Lose Kopplung von Systemkomponenten. Bericht der GMD 96, St.Augustin: Gesellschaft für Mathematik und Datenverarbeitung, 1975Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • H. J. Genrich
    • 1
  • K. Lautenbach
    • 1
  • P. S. Thiagarajan
    • 1
  1. 1.Institut für Informationssystemforschung (ISF) Gesellschaft für Mathematik und Datenverarbeitung Schloss BirlinghovenSt.Augustin 1

Personalised recommendations