iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/3-540-08921-7_94
Analyzing program solutions of coordination problems by cp-nets | SpringerLink
Skip to main content
Springer Nature Link
Log in

Analyzing program solutions of coordination problems by cp-nets

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1978 (MFCS 1978)

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

Abstract

Remembering the history of DIJKSTRA's problem and of its various solutions it seems that this problem is vexatious enough to test how useful a formal model can be in describing and building up structures of concurrently running processes. Insofar, with the results mentioned above first steps have been made to solve and to analyze a larger class of coordination problems.

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.

Similar content being viewed by others

References

  1. De Bruijn, N.G.: Additional Comments on a Problem in Concurrent Programming Control; CACM, Vol. 10 No. 3, pp. 137–138

    Google Scholar 

  2. Dijkstra, E.W.: Solution of a Problem in Concurrent Programming Control; CACM, Vol. 8 No. 9, p. 569

    Google Scholar 

  3. Eisenberg, M.A. and Mc Guire, M.R.: Further Comments on Dijkstra's Concurrent Programming Control Problem; CACM, Vol. 15 No. 11, p. 999

    Google Scholar 

  4. Knuth, D.E.: Additional Comments on a Problem in Concurrent Programming Control; CACM, Vol. 9 No. 5, pp. 321–323

    Google Scholar 

  5. Petri, C.A.: Non-Sequential Processes; GMD-ISF Report ISF-77-01

    Google Scholar 

  6. Schiffers, M.: Behandlung eines Synchronisationsproblems mit gefärbten Petri-Netzen; Diplom thesis, Bonn 1977 (German)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Zentrallaboratorium für Fernschreib- und Signaltechnik Siemens AG, Postfach 700072, D-8000, München 70

    Michael Schiffers

  2. Gesellschaft für Mathematik und Datenverarbeitung, Postfach 1240, D-5205, St. Augustin 1

    Horst Wedde

Authors
  1. Michael Schiffers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Horst Wedde
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schiffers, M., Wedde, H. (1978). Analyzing program solutions of coordination problems by cp-nets. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_94

Download citation

  • DOI: https://doi.org/10.1007/3-540-08921-7_94

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08921-6

  • Online ISBN: 978-3-540-35757-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation