Skip to main content
SpringerLink
Log in

Bundle Event Structures and CCSP

  • Conference paper
CONCUR 2003 - Concurrency Theory (CONCUR 2003)

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

Included in the following conference series:

Abstract

We investigate which event structures can be denoted by means of closed CCS ∪ CSP expressions.

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. Bednarczyk, M.: Hereditary history preserving bisimulation, or what is the power of the future perfect in program logics. Technical report, Polish Academy of Sciences, Gdańsk. (1991), Available at ftp://ftp.ipipan.gda.pl/marek/historie.ps.gz

  2. Boudol, G., Castellani, I.: Flow models of distributed computations: Three equivalent semantics for CCS. Information and Computation 114(2), 247–314 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM 31(3), 560–599 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  4. van Glabbeek, R.J.: On the expressiveness of ACP (extended abstract). In: Ponse, A., Verhoef, C., van Vlijmen, S.F.M. (eds.) Proceedings First Workshop on the Algebra of Communicating Processes, ACP94, Utrecht, Workshops in Computing, pp. 188–217. Springer, Heidelberg (1994), Available at http://boole.stanford.edu/pub/acp.ps.gz

    Google Scholar 

  5. van Glabbeek, R.J., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37, 229–327 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. van Glabbeek, R.J., Plotkin, G.D.: Configuration structures (extended abstract). In: Kozen, D. (ed.) Proceedings 10th Annual IEEE Symposium on Logic in Computer Science (LICS 1995), San Diego, USA, pp. 199–209. IEEE Computer Society Press, Los Alamitos (1995)

    Chapter  Google Scholar 

  7. van Glabbeek, R.J., Vaandrager, F.W.: Petri net models for algebraic theories of concurrency (extended abstract). In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 224–242. Springer, Heidelberg (1987)

    Google Scholar 

  8. van Glabbeek, R.J., Vaandrager, F.W.: The difference between splitting in n and n+1 (abstract). In: Best, E., Rozenberg, G. (eds.) Proc. 3rd Workshop on Concurrency and Compositionality, Goslar, GMD-Studien Nr. 191, Universität Hildesheim, pp. 117–121 (1991); Full version in Information and Computation 136(2), 109–142 (1997)

    Google Scholar 

  9. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  10. Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Information and Computation 127(2), 164–185 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  11. Langerak, R.: Transformations and Semantics for LOTOS. PhD thesis, Department of Computer Science, University of Twente (1992)

    Google Scholar 

  12. Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  13. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theoretical Computer Science 13(1), 85–108 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  14. Nielsen, M., Winskel, G.: Petri nets and bisimulation. Theoretical Computer Science 153, 211–244 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Rabinovich, A., Trakhtenbrot, B.A.: Behavior structures and nets. Fundamenta Informaticae 11(4), 357–404 (1988)

    MATH  MathSciNet  Google Scholar 

  16. Vaandrager, F.W.: Expressiveness results for process algebras. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1992. LNCS, vol. 666, pp. 609–638. Springer, Heidelberg (1993)

    Google Scholar 

  17. Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)

    Google Scholar 

  18. Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, pp. 364–397. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  19. Winskel, G., Nielsen, M.: Models for concurrency. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, pp. 1–148. Oxford University Press, Oxford (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National ICT Australia, School of Computer Science & Engineering, Univ. of New South Wales, Sydney, 2052, Australia

    Rob van Glabbeek

  2. Nijmegen Institute for Computing and Information Sciences, University of Nijmegen, Postbus 9010, 6500 GL, Nijmegen, The Netherlands

    Frits Vaandrager

Authors
  1. Rob van Glabbeek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frits Vaandrager
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Paris 7, PPS, Case 7014, 75205, Paris Cedex 13, France

    Roberto Amadio

  2. LIF, CNRS, Aix-Marseille Université, France

    Denis Lugiez

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Glabbeek, R., Vaandrager, F. (2003). Bundle Event Structures and CCSP. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45187-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40753-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation