Skip to main content
SpringerLink
Log in

Three equivalent semantics for CCS

  • Conference paper
  • First Online:
Book cover Semantics of Systems of Concurrent Processes (LITP 1990)

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

Included in the following conference series:

This work has been partly supported by ESPRIT Basic Research Action 3011 CeDiSys.

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. M. A. Bednarczyk, Categories of asynchronous systems, Ph. D. Thesis, University of Sussex (1987).

    Google Scholar 

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

    Google Scholar 

  3. G. Berry, J.-J. Lévy, minimal and optimal computations of recursive programs, J. of ACM 26 (1979) 148–175.

    Google Scholar 

  4. E. Best, R. Devillers, Interleaving and partial orders in concurrency: a formal comparison, in Formal Description of Programming Concepts III, North-Holland (1987) 299–321.

    Google Scholar 

  5. G. Boudol, Computational semantics of term rewriting systems, in Algebraic Methods in Semantics (M. Nivat & J.C. Reynolds Eds), Cambridge University Press (1985) 169–236.

    Google Scholar 

  6. G. Boudol, Flow event structures and flow nets, in this volume (1990).

    Google Scholar 

  7. G. Boudol, I. Castellani, On the semantics of concurrency: partial orders and transition systems, TAPSOFT 87, Lecture Notes in Comput. Sci. 249 (1987) 123–137.

    Google Scholar 

  8. G. Boudol, I. Castellani, Concurrency and atomicity, Theoretical Comput. Sci. 59 (1988) 25–84.

    Google Scholar 

  9. G. Boudol, I. Castellani, Permutation of transitions: an event structure semantics for CCS and SCCS, in Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Comput. Sci. 354 (1988) 411–427.

    Google Scholar 

  10. G. Boudol, I. Castellani, A non-interleaving semantic for CCS based on proved transitions, Fundamenta Informaticae XI (1988) 433–452.

    Google Scholar 

  11. G. Boudol, I. Castellani, Computations of distributed systems, Part 2: three equivalent semantics for CCS, full version of this paper, to appear as an INRIA report (1990).

    Google Scholar 

  12. S. Brookes, C. A. R. Hoare, A. Roscoe, A theory of communicating sequential processes, JACM 31 (1984) 560–599.

    Google Scholar 

  13. S. Brookes, W. C. Rounds, Behavioural equivalence relations induced by programming logics, ICALP 83, Lecture Notes in Comput. Sci. 154 (1983) 97–108.

    Google Scholar 

  14. I. Castellani, M. Hennessy, Distributed Bisimulations, JACM 36 (1989) 887–911.

    Google Scholar 

  15. I. Castellani, Bisimulations for concurrency, Ph. D. Thesis, University of Edinburgh, CST-51-88 (1988).

    Google Scholar 

  16. I. Castellani, G. Q. Zhang, Parallel product of event structures, INRIA Res. Rep. 1078 and DAIMI Rep. PB-285, Aarhus University (1989).

    Google Scholar 

  17. Ph. Darondeau, P. Degano, Causal trees, ICALP 89, Lecture Notes in Comput. Sci. 372 (1989) 234–248.

    Google Scholar 

  18. P. Degano, R. De Nicola, U. Montanari, Partial ordering derivations for CCS, FCT 85, Lecture Notes in Comput. Sci. 199 (1985) 520–533.

    Google Scholar 

  19. P. Degano, R. De Nicola, U. Montanari, Concurrent histories: a basis for observing distributed systems, J. of Computer and Systems Sciences 34 (1987) 422–461.

    Google Scholar 

  20. P. Degano, R. De Nicola, U. Montanari, On the consistency of “truly concurrent” operational and denotational semantics, LICS 88 (1988) 133–141.

    Google Scholar 

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

    Google Scholar 

  22. R. De Nicola, Extensional equivalences for transition systems, Acta Informatica 24 (1987) 211–237.

    Google Scholar 

  23. H. J. Genrich, K. Lautenbach, P. S. Thiagarajan, Elements of general net theory, in Net Theory and Applications (W. Brauer, Ed.) Lecture Notes in Comput. Sci. 84 (1980) 21–163.

    Google Scholar 

  24. R. van Glabbeek, F. Vaandrager, Petri net models for algebraic theories of concurrency, Proceedings PARLE Conference, Eindhoven, Lecture Notes in Comput. Sci. 259 (1987) 224–242.

    Google Scholar 

  25. R. van Glabbeek, U. Goltz, Equivalence notions for concurrent systems and refinement of actions, MFCS 89, Lecture Notes in Comput. Sci. 379 (1989) 237–248.

    Google Scholar 

  26. R. van Glabbeek, U. Goltz, Equivalence notions and refinement of actions for flow event structures, Draft (march1990).

    Google Scholar 

  27. U. Goltz, Building structured Petri nets, Arbeitspapiere der GMD 223 (1986).

    Google Scholar 

  28. U. Goltz, On representing CCS programs by finite Petri nets, MFCS 88, Lecture Notes in Comput. Sci. 324 (1988) 339–350.

    Google Scholar 

  29. U. Goltz, A. Mycroft, On the relationship of CCS and Petri nets, ICALP 84, Lecture Notes in Comput. Sci. 172 (1984) 196–208.

    Google Scholar 

  30. U. Goltz, R. Loogen, A non-interleaving semantic model for nondeterministic concurrent processes, Tech. Report 87-15, RWTH Aachen (1987).

    Google Scholar 

  31. G. L. Ferrari, U. Montanari, Towards the unification of models for concurrency, to appear in Proc. CAAP90, Lecture Notes in Comput. Sci. 431 (1990).

    Google Scholar 

  32. G. L. Ferrari, Unifying models of concurrency, Ph. D. Thesis, University of Pisa (1990).

    Google Scholar 

  33. M. Hennessy, An Algebraic Theory of Processes, MIT Press (1988).

    Google Scholar 

  34. M. Hennessy, Observing processes, in Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Comput. Sci. 354 (1988) 173–200.

    Google Scholar 

  35. G. Huet, J.-J. Lévy, Call-by-need computations in non-ambiguous linear term rewriting systems, IRIA-LABORIA Report 359 (1979).

    Google Scholar 

  36. M. Z. Kwiatkowska, Fairness for non-interleaving concurrency, Ph. D. Thesis, Department of Computing Studies, University of Leicester, Techn. Rep. 22 (1989).

    Google Scholar 

  37. J.-J. Lévy, Optimal reductions in the lambda calculus, in To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.P. Seldin, J.R. Hindley, Eds), Academic Press (1980) 159–191.

    Google Scholar 

  38. A. Mazurkiewicz, Concurrent program schemes and their interpretations, Aarhus Workshop on Verification of Parallel Programs, Daimi PB-78, Aarhus University (1977).

    Google Scholar 

  39. A. Mazurkiewicz, Basic notions of trace theory, in Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Comput. Sci. 354 (1988) 285–363.

    Google Scholar 

  40. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Comput. Sci. 92 (1980) reprinted in Report ECS-LFCS-86-7, Edinburgh University.

    Google Scholar 

  41. R. Milner, Communication and Concurrency, Prentice-Hall International Series in Computer Science (1989).

    Google Scholar 

  42. R. Milner, Operational and algebraic semantics of concurrent processes, LFCS Report ECS-LFCS-88-46, Edinburgh Univ. (1988).

    Google Scholar 

  43. M. Nielsen, G. Plotkin, G. Winskel, Petri nets, event structures and domains, Theoret. Comput. Sci. 13 (1981) 85–108.

    Google Scholar 

  44. M. Nielsen, G. Rozenberg, P. S. Thiagarajan, Elementary transition systems, presented at the 2nd Workshop on Concurrency and Compositionality, S. Miniato (1990).

    Google Scholar 

  45. E.-R. Olderog, Operational Petri net semantics for CCSP, Advances in Petri Nets 87, Lecture Notes in Comput. Sci. 266 (1987) 196–223.

    Google Scholar 

  46. C. A. Petri, Non-sequential processes, GMD-ISF Rep. 77-05 (1977).

    Google Scholar 

  47. G. Plotkin, A Structural approach to operational semantics, Daimi FN-19, Aarhus University (1981).

    Google Scholar 

  48. V. R. Pratt, Modelling concurrency with partial orders, Intern. J. of Parallel Programming 15 (1986) 33–71.

    Google Scholar 

  49. W. Reisig, Petri Nets: an Introduction, EATCS monographs, Springer Verlag (1985).

    Google Scholar 

  50. B. Rozoy, On distributed languages and models for distributed computation, presented at: 18ème Ecole de Printemps d'Informatique Théorique, La Roche-Posay (april1990).

    Google Scholar 

  51. M. W. Shields, Deterministic asynchronous automata, in: Formal Methods in Programming, North-Holland (1985).

    Google Scholar 

  52. E. W. Stark, Concurrent transition systems, Theoret. Comput. Sci. 64 (1989) 221–269.

    Google Scholar 

  53. D. Taubner, Finite representations of CCS and TCSP programs by automata and Petri nets, Lecture Notes in Comput. Sci. 369, Springer (1989).

    Google Scholar 

  54. P. S. Thiagarajan, G. Rozenberg, M. Nielsen, A relationship between the event structure and trace semantics of elementary net systems, Draft (1988).

    Google Scholar 

  55. F. Vaandrager, A simple definition for parallel composition of prime event structures, Tech. Rep. CS-R8903, CWI, Amsterdam (1989).

    Google Scholar 

  56. G. Winskel, Event structure semantics for CCS and related languages, Daimi PB-159, Aarhus University (1983) s.a. 9th ICALP, Lecture Notes in Comput. Sci. 140 (1982) 561–576.

    Google Scholar 

  57. G. Winskel, Categories of models for concurrency, Seminar on Concurrency, Lecture Notes in Comput. Sci. 197 (1985) 246–267.

    Google Scholar 

  58. G. Winskel, Event structures, Advances in Petri Nets 86, Lecture Notes in Comput. Sci. 255 (1987) 325–392.

    Google Scholar 

  59. G. Winskel, An introduction to event structures, in Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Comput. Sci. 354 (1988) 364–397.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inria Sophia-Antipolis, 06560, Valbonne, France

    Gérard Boudol & Ilaria Castellani

Authors
  1. Gérard Boudol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ilaria Castellani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Irène Guessarian

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Boudol, G., Castellani, I. (1990). Three equivalent semantics for CCS. In: Guessarian, I. (eds) Semantics of Systems of Concurrent Processes. LITP 1990. Lecture Notes in Computer Science, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53479-2_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-53479-2_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46897-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation