Bundle Event Structures and CCSP

  • Rob van Glabbeek
  • Frits Vaandrager
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2761)

Abstract

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Boudol, G., Castellani, I.: Flow models of distributed computations: Three equivalent semantics for CCS. Information and Computation 114(2), 247–314 (1994)MATHCrossRefMathSciNetGoogle Scholar
  3. 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)MATHCrossRefMathSciNetGoogle Scholar
  4. 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. 5.
    van Glabbeek, R.J., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37, 229–327 (2001)MATHCrossRefMathSciNetGoogle Scholar
  6. 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)CrossRefGoogle Scholar
  7. 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. 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. 9.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)MATHGoogle Scholar
  10. 10.
    Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Information and Computation 127(2), 164–185 (1996)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Langerak, R.: Transformations and Semantics for LOTOS. PhD thesis, Department of Computer Science, University of Twente (1992)Google Scholar
  12. 12.
    Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)MATHGoogle Scholar
  13. 13.
    Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theoretical Computer Science 13(1), 85–108 (1981)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Nielsen, M., Winskel, G.: Petri nets and bisimulation. Theoretical Computer Science 153, 211–244 (1996)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Rabinovich, A., Trakhtenbrot, B.A.: Behavior structures and nets. Fundamenta Informaticae 11(4), 357–404 (1988)MATHMathSciNetGoogle Scholar
  16. 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. 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. 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)CrossRefGoogle Scholar
  19. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Rob van Glabbeek
    • 1
  • Frits Vaandrager
    • 2
  1. 1.National ICT Australia, School of Computer Science & EngineeringUniv. of New South WalesSydneyAustralia
  2. 2.Nijmegen Institute for Computing and Information SciencesUniversity of NijmegenNijmegenThe Netherlands

Personalised recommendations