Skip to main content
SpringerLink
Log in

A Causality-based Semantics for CCS

  • Conference paper
Book cover NAPAW 92

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 34 Accesses

Abstract

In this paper we present an original approach providing a causality-based semantics for CCS based on preliminary results appeared in [6, 7, 8, 11]. This approach relies on a simple intuition related to the expression of causal relationships among occurrences of actions, in a way closely related to the notion of variable abstraction of Lambda-Calculus. Main results deal with the definition of an operational semantics, as well as with the characterization of strong and weak bisimulation equivalences within the proposed causality framework. Discussion is provided aiming at relating the proposed approach with other approaches, like Causal Trees and location-based semantics, presenting some degree of similarity with ours, at least at an intuitive level.

On leave from the Dept. of Computer Science of the Universidade Federal de Santa Catarina.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boudol, G., and Castellani, I. Concurrency and atomicity. TCS 59 (1988), 1–60.

    Article  MathSciNet  Google Scholar 

  2. Boudol, G., and Castellani, I. Permutation of transitions: An event structure semantics for CCS and SCCS. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, J. de Bakker, W.-P. de Roever, and G. Rozenberg, Eds., vol. 354 of LNCS. Springer-Verlag, 1989, pp. 411–427.

    Chapter  Google Scholar 

  3. Boudol, G., Castellani, I., Kiehn, A., and Hennessy, M. Observing localities. In Proc. of Mathematical Foundations of Computer Science 1991, A. Tarlecki, Ed., vol. 520 of LNCS. Springer-Verlag, 1991, pp. 93–102.

    Google Scholar 

  4. Castellani, I., and Hennessy, M. Distributed bisimulation. J. ACM 36 (1989), 887–911.

    Article  MathSciNet  MATH  Google Scholar 

  5. Coelho da Costa, R. J. PhD thesis, Université Paul Sabatier, Toulouse, 1992. To appear.

    Google Scholar 

  6. Coelho da Costa, R. J., and Courtiat, J.-P. Definition of a new notation for representing pomsets (preliminary report). Rapport de Recherche 91121, LAAS, Mar. 1991.

    Google Scholar 

  7. Coelho da Costa, R. J., and Courtiat, J.-P. POC: A partial order calculus for modeling concurrent systems. Rapport de recherche 91179, LAAS, May 1991.

    Google Scholar 

  8. Coelho da Costa, R. J., and Courtiat, J.-P. SPOC — A simple partial order calculus for representing pomsets. In Proceedings of the XVIII Integrated Seminar on Software and Hardware (Santos/Sâo Paulo - Brazil, Aug. 1991). Also available as Rapport de Recherche LAAS No. 91156 (May/1991).

    Google Scholar 

  9. Coelho da Costa, R. J., and Courtiat, J.-P. A true concurrency semantics for LOTOS. In Proc. of the IFIP TC61WG6.1 5th Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols, FORTE’92 (Perros-Guirec, France, Oct. 1992), M. Diaz and G. R, Eds., North-Holland. Also available as Rapport de Recherche LAAS No. 92017, January/1992.

    Google Scholar 

  10. Coelho da Costa, R. J., and Courtiat, J.-P. Using Petri nets as a model for Petri nets. In Proceedings of Third IEEE Workshop on Future Trends of Distributed Computing Systems in the 1990’s (Taipei, Apr. 1992), IEEE Computer Society Press.

    Google Scholar 

  11. Courtiat, J.-P., and Coelho da Costa, R. J. A LOTOS based calculus with true concurrency semantics. In Proc. of the IFIP TC6/WG6.1 Fourth Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols, FORTE’91 (Sydney, Australia, Nov. 1991 ), G. A. Rose and K. R. Parker, Eds., North-Holland.

    Google Scholar 

  12. Darondeau, P., and Degano, P. Causal trees. In Proc. of 16th ICALP, G. Ausiello, M. Dezani-Ciancaglini, and S. R. D. Rocca, Eds., vol. 372 of Springer LNCS. 1989, pp. 234–248.

    Google Scholar 

  13. Darondeau, P., and Degano, P. Causal trees: interleaving + causality. In Semantics of Systems of Concurrent Processes, Proc. of LITP Spring School on Theor. Comp. Sci, I. Guessarian, Ed., vol. 469 of LNCS. Springer-Verlag, 1990, pp. 239–255.

    Google Scholar 

  14. Degano, P., De Nicola, R., and Montanari, U. A partial ordering semantics for CCS. Theor. Comp. Sci. 75 (1990), 223–262.

    Article  MATH  Google Scholar 

  15. Degano, P., and Montanari, U. Concurrent histories: a basis for observing distributed systems. J. of Comput. System Sci. 34 (1987), 422–461.

    Article  MathSciNet  MATH  Google Scholar 

  16. Ferrari, G. L., and Montanari, U. Towards the unification of models for concurrency. In Coll. on Algebra and Trees in Prog. (CAAP’90) (Copenhagen, 1990). (LNCS 431, 162–176).

    Google Scholar 

  17. Ferrari, G. L., and Montanari, U. The observation algebra of spatial pomsets. In CONCUR’91 — 2nd Int. Conference on Concurrency Theory, J. C. M. Baeten and J. F. Groote, Eds., vol. 527 of LNCS. Springer-Verlag, 1991, pp. 188–202.

    Google Scholar 

  18. Kiehn, A. Local and global causes. Research Report 342/23/91, Technishe Universität Müchen, Institut für Informatik, Aug. 1991.

    Google Scholar 

  19. Kiehn, A. Distributed bisimulation for finite CCS. CS Report 7/89, University of Sussex, Apr. ( December ) 1989.

    Google Scholar 

  20. Milner, R. A Calculus of Communicating Systems, vol. 92 of LNCS. Springer-Verlag, 1980.

    MATH  Google Scholar 

  21. Nielsen, M. CCS- and its relationship to net theory. In Advanced Course in Petri Nets, W. Brauer, W. Reisig, and G. Rozenberg, Eds., vol. 255 of LNCS. Springer-Verlag, Bad Honeff 1986, 1987, pp. 393–415.

    Google Scholar 

  22. Olderog, E.-R. Operational Petri net semantics for CSP. In Advances in Petri Nets 1987, G. Rozenberg, Ed., vol. 266 of LNCS. Springer-Verlag, 1987, pp. 196–223.

    Google Scholar 

  23. Taubner, D. The representation of CCS programs by finite predicate/transition nets. In Xah International Conference on Application and Theory of Petri Nets (Bonn-Germany, 1989), pp. 348–370.

    Google Scholar 

  24. van Glabbeek, R., and Vaandrager, F. Petri net models for algebraic theories of concurrency. In Proc. PARLE Conf. (1987), A. N. J. W. de Bakker and P. Treleaven, Eds., vol. 259 of LNCS,Springer-Verlag.

    Google Scholar 

  25. Winskel, G. Event structures. In Advanced Course on Petri Nets, vol. 255 of LNCS. Springer-Verlag, 1987, pp. 325–392.

    Google Scholar 

Download references

Author information

Author notes

  1. R. J. Coelho da Costa

    Present address: Dept. of Computer Science (CEC/CTC), Universidade Federal de Santa Catarina, Trindade, Caixa Postal 476, 88049, Florianópolis-SC, Brazil

Authors and Affiliations

  1. LAAS/CNRS, 7, Av. du Colonel Roche, 31077, Toulouse Cedex, France

    R. J. Coelho da Costa & J.-P. Courtiat

Authors
  1. R. J. Coelho da Costa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J.-P. Courtiat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, 333 Whitmore Laboratory, The Pennsylvania State University, 16802, University Park, PA, USA

    S. Purushothaman PhD

  2. Department of Computer Science, The Johns Hopkins University, 21218, Baltimore, MD, USA

    Amy Zwarico

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Coelho da Costa, R.J., Courtiat, JP. (1993). A Causality-based Semantics for CCS. In: Purushothaman, S., Zwarico, A. (eds) NAPAW 92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3217-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3217-2_12

  • Publisher Name: Springer, London

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

  • Online ISBN: 978-1-4471-3217-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation