Skip to main content
SpringerLink
Log in

Representing CCS programs by finite predicate/transition nets

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A construction is given which for CCS programs (in which every choice and recursion starts sequentially) yields a finite and strict predicate/ transition net. Consistency of this construction is proved not only with respect to the standard interleaving semantics but with respect to the distributed operational semantics of Degano, De Nicola, and Montanari which additionally models the concurrency explicitly.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barendregt, H.P.: The lambda calculus — its syntax and semantics. Amsterdam: North-Holland 1985

    Google Scholar 

  2. Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theor. Comput. Sci. 37, 77–121 (1985)

    Google Scholar 

  3. Best, E., Devillers, R.: Sequential and concurrent behaviour in Petri net theory. Theor. Comput. Sci. 55, 87–136 (1987)

    Google Scholar 

  4. Best, E., Fernández, C.: Notations and terminology on Petri net theory. Arbeitspapiere der GMD Nr. 195, Bonn (1986)

  5. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. Assoc. Comput. Mach. 31, 560–599 (1984)

    Google Scholar 

  6. Cherkasova, L.A., Kotov, V.E.: Structured nets. In: Gruska, J., Chytil, M. (eds.) Mathematical foundations in computer science 1981. Proceedings, Štrbské Pleso 1981. (Lect. Notes Comput. Sci., vol. 118, pp. 242–251) Berlin Heidelberg New York: Springer 1981

    Google Scholar 

  7. De Cindio, F., De Michelis, G., Pomello, L., Simone, C.: Milner's communicating systems and Petri nets. In: Pagnoni, A., Rozenberg, G. (eds.) Application and theory of Petri nets. (Inf.-Fachber., vol. 66, pp. 40–59) Berlin Heidelberg New York: Springer 1983

    Google Scholar 

  8. Degano, P., De Nicola, R., Montanari, U.: Partial ordering derivations for CCS. In: Budach, L. (ed.) Fundamentals of computation theory. Proceedings, Cottbus 1985. (Lect. Notes Comput. Sci., vol. 199, pp. 520–533) Berlin Heidelberg New York: Springer 1985

    Google Scholar 

  9. Degano, P., De Nicola, R., Montanari, U.: CCS is an (augmented) contact free C/E system. In: Venturini Zilli, M. (ed.) Mathematical models for the semantics of parallelism. Proceedings, Rome 1986. (Lect. Notes Comput. Sci., vol. 280, pp. 144–165) Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  10. Degano, P., De Nicola, R., Montanari, U.: A distributed operational semantics for CCS based on condition/event systems. Acta Inf. 26, 59–91 (1988)

    Google Scholar 

  11. De Nicola, R., Hennessy, M.C.B.: CCS without τ's. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds.) TAPSOFT '87. Vol. 1. Proceedings, Pisa 1987. (Lect. Notes Comput. Sci., vol. 249, pp. 138–152) Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  12. Engberg, U., Nielsen, M.: A calculus of communicating systems with label passing. Aarhus University, Report DAIMI PB-208, 1986

  13. Gehani, N.: Ada (an advanced introduction including reference manual for the Ada programming language). Englewood Cliffs: Prentice-Hall 1984

    Google Scholar 

  14. Genrich, HJ.: Predicate/transition nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri nets: Central models and their properties. Advances in Petri nets 1986, Part I. Proceedings, Bad Honnef 1986. (Lect. Notes Comput. Sci., vol. 254, pp. 207–247) Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  15. van Glabbeek, R., Vaandrager, F.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE, Parallel architectures and languages Europe. Vol. II. Proceedings, Eindhoven 1987. (Lect. Notes Comput. Sci., vol. 259, pp. 224–242) Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  16. Goltz, U.: Über die Darstellung von CCS-Programmen durch Petrinetze. Dissertation, RWTH Aachen, 1987. Also available as GMD-Bericht Nr. 172, München: Oldenbourg 1988 (for an English short version see [17])

    Google Scholar 

  17. Goltz, U.: On representing CCS programs by finite Petri nets. In: Chytil, M.P., Janiga, L., Koubek, V. (eds.) Mathematical foundations of computer science 1988. Proceedings, Carlsbad — Karlovy Vary 1988. (Lect. Notes Comput. Sci., vol. 324, pp. 339–350) Berlin Heidelberg New York: Springer 1988

    Google Scholar 

  18. Goltz, U., Mycroft, A.: On the relationship of CCS and Petri nets. In: Paredaens, J. (ed.) Automata, languages and programming. Proceedings, Antwerp 1984. (Lect. Notes Comput. Sci., vol. 172, pp. 196–208) Berlin Heidelberg New York: Springer 1984

    Google Scholar 

  19. Goltz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Inf. Control 57, 125–147 (1983)

    Google Scholar 

  20. Goltz, U., Reisig, W.: CSP-programs as nets with individual tokens. In: Rozenberg, G. (ed.) Advances in Petri nets 1984. (Lect. Notes Comput. Sci., vol. 188, pp. 169–196) Berlin Heidelberg New York: Springer 1985

    Google Scholar 

  21. Greibach, S.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci. 7, 311–324 (1978)

    Google Scholar 

  22. Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21, 666–677 (1978)

    Google Scholar 

  23. Inmos Limited: Occam 2 reference manual. New York: Prentice-Hall 1988

    Google Scholar 

  24. Jensen, K.: Coloured Petri nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri nets: Central models and their properties. Advances in Petri nets 1986, Part I. Proceedings, Bad Honnef 1986. (Lect. Notes Comput. Sci., vol. 254, pp. 248–299) Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  25. Kiehn, A.: On the interrelation between synchronized and non-synchronized behaviour of Petri nets. J. Inf. Process. Cybern. 24, 3–18 (1988)

    Google Scholar 

  26. Kotov, V.E.: An algebra for parallelism based on Petri nets. In: Winkowski, J. (ed.) Mathematical foundations of computer science. Proceedings, Zakopane 1978. (Lect. Notes Comput. Sci., vol. 64, pp. 39–55) Berlin Heidelberg New York: Springer 1978

    Google Scholar 

  27. Lauer, P.E., Campbell, R.H.: Formal semantics of a class of high-level primitives for coordinating concurrent processes. Acta Inf. 5, 297–332 (1975)

    Google Scholar 

  28. Meseguer, J., Montanari, U.: Petri nets are monoids: A new algebraic foundation of net theory. In: Third annual symposium on logic in computer science. Proceedings, Edinburgh, Scotland 1988, pp. 155–164. Washington: Computer Science Press 1988

    Google Scholar 

  29. Milner, R.: A calculus of communicating systems. (Lect. Notes Comput. Sci., vol. 92) Berlin Heidelberg New York: Springer 1980

    Google Scholar 

  30. Milner, R.: Lectures on a calculus of communicating systems. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds.): Seminar on concurrency. Proceedings, Pittsburgh 1984. (Lect. Notes Comput. Sci., vol. 197, pp. 197–220) Berlin Heidelberg New York: Springer 1985

    Google Scholar 

  31. Nielsen, M: CCS — and its relationship to net theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri nets: Applications and relationships to other models of concurrency. Advances in Petri nets 1986, Part II. Proceedings, Bad Honnef 1986. (Lect. Notes Comput. Sci., vol. 255, pp. 393–415) Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  32. Olderog, E.-R.: Operational Petri net semantics for CCSP. In: Rozenberg, G. (ed.) Advances in Petri nets 1987. (Lect. Notes Comput. Sci., vol. 266, pp. 196–223) Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  33. Olderog, E.-R., Hoare, C.A.R.: Specification-oriented semantics for communicating processes. Acta Inf. 23, 9–66 (1986)

    Google Scholar 

  34. Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Theoretical computer science. Proceedings, Karlsruhe 1981. (Lect. Notes Comput. Sci., vol. 104, pp. 167–183) Berlin Heidelberg New York: Springer 1981

    Google Scholar 

  35. Plotkin, G.D.: A structural approach to operational semantics. Univ. Aarhus, Report DAIMI FN-19, 1981

  36. Pomello, L.: Some equivalence notions for concurrent systems. In: Rozenberg, G. (ed.) Advances in Petri nets 1985. (Lect. Notes Comput. Sci., vol. 222, pp. 381–400) Berlin Heidelberg New York: Springer 1986

    Google Scholar 

  37. Reisig, W.: Petri nets — An introduction. Berlin Heidelberg New York: Springer 1985

    Google Scholar 

  38. Sammer, W., Schwärtzel, H.: CHILL. Eine moderne Programmiersprache für Systemtechnik. Berlin Heidelberg New York: Springer 1982

    Google Scholar 

  39. Taubner, D.: Finite representations of CCS and TCSP programs by automata and Petri nets. (Lect. Notes Comput. Sci., vol. 369) Berlin Heidelberg New York: Springer 1989

    Google Scholar 

  40. Vogler, W.: Executions: A new partial order semantics of Petri nets. Theor. Comput. Sci. (to appear)

  41. Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri nets: Applications and relationships to other models of concurrency. Advances in Petri nets 1986, Part II. Proceedings, Bad Honnef 1986. (Lect. Notes Comput. Sci., vol. 255, pp. 325–392) Berlin Heidelberg New York: Springer 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Corporate Research and Development (ZFE IS INF2), Siemens AG, Otto-Hahn-Ring 6, D-8000, München 83, Federal Republic of Germany

    Dirk Taubner

Authors
  1. Dirk Taubner
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work presented here has been carried out at the Institute for Informatics of the Technical University of Munich while the author was supported by an Ernst-von-Siemens scholarship

Rights and permissions

Reprints and permissions

About this article

Cite this article

Taubner, D. Representing CCS programs by finite predicate/transition nets. Acta Informatica 27, 533–565 (1990). https://doi.org/10.1007/BF00277389

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00277389

Keywords

Search

Navigation