[go: up one dir, main page]

Skip to main content

Csp-programs as nets with individual tokens

  • Conference paper
  • First Online:
Advances in Petri Nets 1984

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

  • 130 Accesses

Abstract

We define a subclass of predicate/transition-nets and show how to translate CSP-programs into such nets. We consider a subset of CSP for which Hennessy, Li and Plotkin have given an operational semantics in [HLP]. We show that the firing sequences of our net translation correspond to this operational semantics. Additionally, we also give a non-interleaving semantics to CSP by considering unfoldings and processes of the net translation.

This enables us to analyse CSP-programs applying net theoretic methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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. E. Best, U. Goltz: "Reachable Markings and Discrete Processes", Internal report, 1983

    Google Scholar 

  2. H.J. Genrich, K. Lautenbach: "System Modelling with High-Level Petri-Nets", TCS 13 (1981) 109–136

    Article  Google Scholar 

  3. H.J. Genrich, K. Lautenbach, P.S. Thiagarajan: "Elements of General Net Theory", in: Net Theory and Applications, LNCS 84, 1980

    Google Scholar 

  4. U. Goltz, A. Mycroft: "On the Relationship of CCS and Petri Nets", in: proc. ICALP 1984, LNCS 172

    Google Scholar 

  5. U. Goltz, A. Mycroft: "Net Behaviour Representations and Equivalence Notions", unpublished manuscript

    Google Scholar 

  6. U. Goltz, W. Reisig: "The Non-Sequential Behaviour of Petri Nets", Information and Control, Vol. 57, Nos. 2–3, May/June 1983

    Google Scholar 

  7. U. Goltz, U. Vogt: "Processes of Relation Nets", in: Petri Nets and Related Models, Newsletter No. 14, June 1983

    Google Scholar 

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

    Article  Google Scholar 

  9. M. Hennessy, W. Li, G. Plotkin: "A first Attempt at Translating CSP into CCS", in: Proceedings of the 2nd International Conference on Distributed Computing, Paris 1981, IEEE, No. 81 CH 1591-7

    Google Scholar 

  10. David May: "Occam", SIGPLAN Notices, Vol. 18, No. 4, April 1983

    Google Scholar 

  11. M. Nielsen, G. Plotkin, G. Winskel: "Petri Nets, Event Structures and Domains", TCS 13, No. 1, Jan. 1981

    Google Scholar 

  12. W. Reisig: A Petri Net Primer", Springer-Verlag 1984, to appear

    Google Scholar 

  13. W. Reisig: "Partial Order Semantics for CSP-like Languages and its Impact on Fairness", in: proc. ICALP 1984, LNCS 172

    Google Scholar 

  14. G. Winskel: "A New Definition of Morphism on Petri Nets", in: proc. STACS 1984, LNCS 166

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goltz, U., Reisig, W. (1985). Csp-programs as nets with individual tokens. In: Rozenberg, G. (eds) Advances in Petri Nets 1984. Lecture Notes in Computer Science, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15204-0_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-15204-0_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15204-0

  • Online ISBN: 978-3-540-39320-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics