Skip to main content
SpringerLink
Log in

Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1984)

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

Included in the following conference series:

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. Dijkstra, Esger, W.: Co-Operating Sequential Processes in F. Genyus (ed.): Programming Languages, Academic Press (1968)

    Google Scholar 

  2. Elrad, Tzilla; Frances, Nissam: Decompositions of Distributed Programs into Communication — Closed Layers Science of Computer Programming 2, 155–173 (1982)

    Google Scholar 

  3. Francesz, Nissam; Hoare, C.A.R.; Lehman, Daniel; de Roever, William P.: Semantics of Nondeterminism, Concurrency and Communication Journal of Computer and System Sciences 19, pp. 290–308 (1979)

    Google Scholar 

  4. Francesz, N.; Lehmann, D.; Pnueli, A.: A Linear History Semantics for Distributed Languages (Extended Abstract) 21. Conference on Foundations of Computer Science IEEE 143–151 (1980)

    Google Scholar 

  5. Hennessy, Matthew; Li, Wei; Plotkin, Gordon: A First Attempt at Translating CSP into CCS Proceedings of the 2nd International Conference on Distributed Computing Systems Paris, France, April 8–10, 1981, IEEE, Computer Society Press pp. 105–114 (1981)

    Google Scholar 

  6. Hoare, C.A.R.: Communicating Sequential Processes Communications of the ACM Vol. 21, No. 8, pp. 666–677 (1978)

    Google Scholar 

  7. Lamport, Leslie: Time, Clocks and the Ordering of Events in a Distributed System Communications of the ACM Vol. 21, No. 7, pp. 558–564 (1978)

    Google Scholar 

  8. Lehmann, D.; Pneuli, A.; Stavi, J.: Impartiality, Justice and Fairness: The Ethics of Concurrent Termination Lecture Notes in Computer Science 115, 264–277 (1981)

    Google Scholar 

  9. Nielsen, M.; Plotkin, G.; Winskel, G.: Petri Nets, Event Structures and Domains, Part I Theoretical Computer Science 13, 85–108 (1981)

    Google Scholar 

  10. Park, David: A Predicate Transformer for Weak Fair Iteration The University of Warwik Report No. 36 (1981)

    Google Scholar 

  11. Petri, Carl-Adam: Non-Sequential Processes Internal Report ISF-77-5, Gesellschaft für Mathematik und Datenverarbeitung Bonn (Germany) (1977)

    Google Scholar 

  12. Plotkin, Gordon.: An Operational Semantics for CSP in: Formal Description of Programming Concepts-II, D. Bjørner (ed.) North Holland Publishing Company, IFIP pp. 199–223 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen, Büchel 29 – 31, D-5100, Aachen, West Germany

    Wolfgang Reisig

Authors
  1. Wolfgang Reisig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reisig, W. (1984). Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

  • Online ISBN: 978-3-540-38886-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation