Skip to main content
SpringerLink
Log in

Rendez- Vous with Bundle Event Structures

  • Conference paper
Semantics of Specification Languages (SoSL)

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

  • 31 Accesses

Abstract

Event structure models have been used to give a non-interleaving semantics to various process algebras such as CSP, ACP, CCS, LOTOS. In this paper we extend the Bundle Event Structure (BεS) model to be able to give a semantics to Full LOTOS. We add data and we introduce a new relation called rendezvous to deal with process recursion.

The addition of data forces us to introduce environments passed with the computation of labelled posets. Unfortunately, by adding Abstract Data Types to describe the data we introduce the semi-computability problem of algebraic specifications w.r.t. equality.

The addition of a new relation called rendezvous complies with lazy evaluation, which entails simulations of possibly infinite bundle event structures. But Goal Oriented Execution techniques are required to reduce the synchronization constraints.

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. G.V. Bochmann, A general transition model for protocol and communication services, IEEE Transactions on Communications, vol 28, nr 4, April 1980

    Google Scholar 

  2. M. Diaz, Modelling and analysis of communication and cooperation protocols using Petri Net based models, In C. Sunshine, editor, Protocol Specification, Testing and Verification, II, Amsterdam, 1983

    Google Scholar 

  3. U. Goltz, A. Rensink, Finite Petri Nets as Models for Recursive Causal Behaviour, Arbeitspapiere der GMD 604, Germany, 1991

    Google Scholar 

  4. ISO 86b, Information processing systems, Estelle

    Google Scholar 

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

    Google Scholar 

  6. R. Langerak, Transformations and Semantics for LOTOS, PhD. Thesis, University of Twente, The Netherlands, 1992

    Google Scholar 

  7. G. Boudol, I. Castellani. Flow Models of Distributed Computations: Event Structures and Nets, INRIA Research Report 1482, Sophia Antipolis, France, 1991

    Google Scholar 

  8. M. Nielsen, G. Plotkin, G. Winskel, Petri nets, event structures and domains, Theoretical Computer Science 13, 1981

    Google Scholar 

  9. F.W. Vaandrager, A simple definition for parallel composition of prime event structures, Report ACMCS-R8903, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1989

    Google Scholar 

  10. G. Winskel, An Introduction to Event Structures, LNCS 354, pp.364–397, Springer Verlag, 1989

    Google Scholar 

  11. G. Winskel, Event structures semantics for CCS and related languages, Proc. 9th ICALP, LNCS 140, pp. 561–576, 1982

    MathSciNet  Google Scholar 

  12. R. Langerak, Bundle Event Structures, Fifth International Conference on Formal Description Techniques, Perros-Guirec, France, 1992

    Google Scholar 

  13. A. Rensink, Posets for Configurations!, Memoranda Informatica 91–20, december 1991, CONCUR, 1992

    Google Scholar 

  14. ISO 8807, Information processing systems, LOTOS - A formal description technique based on the temporal ordering of observational behaviour

    Google Scholar 

  15. J. Schot, The role of Architectural Semantics in the formal approach of Distributed Systems Design, PhD. Thesis, University of Twente, The Netherlands, 1992

    Google Scholar 

  16. J.P. Katoen, R. Langerak, D. Latella, Modelling Systems by Probabilistic Process Algebra, An Event Structures Approach, Forte, Boston, USA, 1993

    Google Scholar 

  17. B. Botma, Protocol Visualization, A (Bundle) Event Structure Approach, Memoranda Informatica, University of Twente, The Netherlands, 1992

    Google Scholar 

  18. E. Madelaine, LOTOS to basic LOTOS projections, Reference Lo/WP2/T2.2/INRIA/N004, Deliverable LOTOSPHERE project (#2304), June 1990

    Google Scholar 

  19. J.M. Hullot, Canonical forms and unification, Proc. 5th Conference on Automated Deduction, Springer-Verlag, 1980

    Google Scholar 

  20. H. Hussmann, Unification in conditional-equational theories, EUROCAL 204, Springer-Verlag, 1985

    Google Scholar 

  21. H. Eertink, D. Wolz, Symbolic execution of LOTOS specifications, Fifth International Conference on Formal Description Techniques, Perros-Guirec, France, 1992

    Google Scholar 

  22. E.W. Stark, Concurrent transition systems, Theoretical Computer Science, 64, pages 221–269, 1989

    Article  MathSciNet  MATH  Google Scholar 

  23. D. Latella, Recursive Bundle Event Structures, Memoranda Informatica 93–27, University of Twente, The Netherlands, 1993

    Google Scholar 

  24. M. Haj-Hussein, L. Logrippo, J. Sincennes, Goal-Oriented Execution for LOTOS, Fifth International Conference on Formal Description Techniques, FORTE92, Lanion, France, 1992

    Google Scholar 

  25. H. Brinksma, H. Eertink, Goal-driven LOTOS execution, Protocol Specification, Testing and Verification, PSTV XIII Liege, Belgium, 1993

    Google Scholar 

  26. B. Botma, A Meta-level Solution for Recursion, Protocol Simulation with Bundle Event Structures, Memoranda Informatica, University of Twente, The Netherlands, 1993

    Google Scholar 

  27. G. Boudol, I. Castellani. Flow Models of Distributed Computations: Three Equivalent Semantics for CCS, ILARIA Research Report 1484, Sophia Antipolis, France, 1991

    Google Scholar 

  28. R. Langerak, Event Structures for the Design and Transformation in LOTOS, In K. Parker, G. Rose, editors, Fourth International Conference on Formal Description Techniques, pages 271–287, Sydney, Australia, 1991

    Google Scholar 

  29. D.H. New, Protocol Visualization, Ph.D. Thesis, University of Delaware, 1991

    Google Scholar 

  30. F.N. Paulish, W.F. Tichy, EDGE: And Extendible Graph Editor, Software-Practice and Experience, vol. 20(S1), june 1990

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Twente, Enschede, The Netherlands

    Bart Botma

Authors
  1. Bart Botma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    D. J. Andrews

  2. Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    J. F. Groote (dr.ir) & C. A. Middelburg (prof.dr.ir) (dr.ir) &  (prof.dr.ir)

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this paper

Cite this paper

Botma, B. (1994). Rendez- Vous with Bundle Event Structures. In: Andrews, D.J., Groote, J.F., Middelburg, C.A. (eds) Semantics of Specification Languages (SoSL). Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3229-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3229-5_15

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19854-3

  • Online ISBN: 978-1-4471-3229-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation