Advertisement

Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars

  • Hans-Jörg Kreowski
  • Anne Wilharm
Part II Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 291)

Abstract

Non-sequential processes in graph grammars are introduced extending the repertoire of parallelism and concurrency known for graph grammar derivations. They are intended to describe the behaviour of systems explicitly where states or data may be distributed and actions may take place concurrently. Our notion of a process is liberal enough to include conflicts among actions so that it reflects potential activities rather than actual running of the system in general. The problem of detecting conflicts in a process is solved by a procedure transforming arbitrary conflicts into local and hence observable ones. For special situations conflict solutions are investigated by applying techniques and results from graph grammar theory.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds): Current Trends in Concurrency, LNCS 224, Springer-Verlag, Berlin Heidelberg New York Tokyo 1986Google Scholar
  2. 2.
    M. Ben-ari: Principles of Concurrent Programming, Prentice-Hall, Hertfordshire 1982Google Scholar
  3. 3.
    P. Boehm, H.-R. Fonio, A. Habel: Amalgamation of Graph Transformations with Applications to Synchronization, Proc. CAPP '85, LNCS 185, Springer-Verlag, Berlin Heidelberg New York Tokyo 1985, 267–283Google Scholar
  4. 4.
    I. Castellani, U. Montanari: Graph Grammars for Distributed Systems, LNCS 153, Springer Verlag, Berlin Heidelberg New York Tokyo 1983, 20–38Google Scholar
  5. 5.
    H. Ehrig, H.-J. Kreowski: Applications of Graph Grammar Theory to Consistency, Synchronization and Scheduling in Data Base Systems, Inform. Syst. 5 (1980), 225–238CrossRefGoogle Scholar
  6. 6.
    M. Ende: Jim Knopf und Lukas der Lokomotivführer, Thienemann Verlag, Stuttgart 1960Google Scholar
  7. 7.
    C.A.R. Hoare, S.D. Brookes, A.W. Roscoe: A Theory of Communicating Sequential Processes, Techn. Monograph PRG-16, Progr. Research Group, Oxford University 1981Google Scholar
  8. 8.
    D. Janssens, H.-J. Kreowski, G. Rozenberg, H. Ehrig: Concurrency of Node-label Controlled Graph Transformations, Technical Report 82-38, U.I.A., University of Antwerp 1982Google Scholar
  9. 9.
    H.-J. Kreowski: A Comparison Between Petri Nets and Graph Grammars, Proc. Int. Workshop WG '80, Bad Honnef, June 1980, LNCS 100, Springer-Verlag, Berlin Heidelberg New York Tokyo 1981, 306–317Google Scholar
  10. 10.
    H.-J. Kreowski: Graph Grammar Derivation Processes, Proc. Int. Workshop WG '83, Osnabrück, June 1983, Trauner Verlag, Linz 1983, 136–150Google Scholar
  11. 11.
    H.-J. Kreowski, A. Wilharm: Processes on Petri Nets and Graph Grammars, Proc. Int. Workshop WG '84, Berlin, June 1984, Trauner Verlag, Linz 1984, 189–200Google Scholar
  12. 12.
    H.-J. Kreowski, A. Wilharm: Net Processes Correspond to Derivation Processes in Graph Grammars, Theoretical Computer Science 44 (1986), 275–305CrossRefGoogle Scholar
  13. 13.
    H.-J. Kreowski, A. Wilharm: Solving Conflicts in Graph Grammar Derivation Processes, Proc. Int. Workshop WG '85, Würzburg, June 1985, Trauner Verlag, Linz 1985, 161–180Google Scholar
  14. 14.
    B. Mahr, A. Wilharm: Graph Grammars as a Tool for Description in Computer Processed Control: A Case Study, Proc. Int. Workshop WG '82, Hanser Verlag, München Wien 1982, 165–176Google Scholar
  15. 15.
    R. Milner: Calculi for Synchroni and Asynchroni, Theoretical Computer Science 25 (1983), 267–310CrossRefGoogle Scholar
  16. 16.
    M. Paul, H.J. Siegert (Eds): Distributed Systems, LNCS 190, Springer-Verlag, Berlin Heidelberg New York Tokyo 1985Google Scholar
  17. 17.
    C.A. Petri: Concurrency, Proc. Net Theory and Applications, LNCS 84, Springer-Verlag, Berlin Heidelberg New York Tokyo 1980, 251–260Google Scholar
  18. 18.
    A. Pnueli: The Temporal Semantics of Concurrent Programs, LNCS 70, Springer-Verlag, Berlin Heidelberg New York Tokyo 1979, 1–20Google Scholar
  19. 19.
    W. Reisig: An Application of Graph grammars to Net Theory, Proc. Int. Workshop WG '80, Bad Honnef, June 1980, LNCS 100, Springer-Verlag, Berlin Heidelberg New York Tokyo 1980, 318–325Google Scholar
  20. 20.
    P. Starke: Graph Grammars for Petri Net Processes, Elektronische Informationsverarbeitung und Kybernetik EIK 19 4/5 (1983), 199–233Google Scholar
  21. 21.
    A. Willharm: Anwendung der Theorie von Graphgrammatiken auf die Spezifikation der Prozesssteuerung von Eisenbahnsystemen, Technical Report 81-15, Technische Universität Berlin 1981Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Hans-Jörg Kreowski
    • 1
  • Anne Wilharm
    • 1
  1. 1.Fachbereich Mathematik/InformatikUniversität BremenBremen 33

Personalised recommendations