Advertisement

Modelling and analysis of distributed program execution in BETA using coloured Petri Nets

  • Jens Bæk Jørgensen
  • Kjeld Høyer Mortensen
Full Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1091)

Abstract

Recently, abstractions supporting distributed program execution in the object-oriented language BETA have been designed. A BETA object on one computer may invoke a remote object, i.e., an object hosted by another computer. In this project, the formalism of Coloured Petri Nets (CP-nets or CPN) is used to describe and analyse the protocol for remote object invocation. In the first place, we build a model in order to describe, understand, and improve the protocol. Remote object invocation in BETA is modelled on the level of threads (lightweight processes) with emphasis on the competition for access to critical regions and shared resources. Secondly, the model is analysed. It is formally proved that it has a set of desirable properties, e.g., absence of dead markings.

Topics

System design and verification using nets higher-level net models computer tools for nets experience with using nets case studies application of nets to protocols 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BM93]
    S. Brandt and O. L. Madsen. Object-Oriented Distributed Programming in BETA. In R. Guerraoui, O.M. Nierstrasz, and M. Riveill, editors, Object-Based Distributed Programming, Lecture Notes in Computer Science, Kaiserslautern, Germany, 1993. Springer-Verlag.Google Scholar
  2. [Bra94]
    S. Brandt. Implementing Shared and Persistent Objects in BETA. Technical report, Computer Science Department, University of Aarhus, 1994.Google Scholar
  3. [BWW91]
    J. Billington, G. R. Wheeler, and M. C. Wilbur-Ham. PROTEAN — A High-level Petri Net Tool for the Specification and Verification of Communication Protocols. In K. Jensen and G. Rozenberg, editors, High-level Petri Nets, Theory and Application. Springer-Verlag, 1991.Google Scholar
  4. [CJ91]
    S. Christensen and L. O. Jepsen. Modelling and Simulation of a Network Management System using Hierarchical Coloured Petri Nets. In E. Mosekilde, editor, Proceedings of the 1991 European Simulation Multiconference, Copenhagen, Denmark, 1991. Springer-Verlag.Google Scholar
  5. [CJK96]
    S. Christensen, K. Jensen, and L. Kristensen. The Design/CPN Occurrence Graph Tool. User's manual version 3.0. Computer Science Department, University of Aarhus, 1996. Online: http: //www.daimi.aau.dk/designCPN/.Google Scholar
  6. [GCH91]
    G. Girault, C. Chatelain, and S. Haddad. Specification and Properties of a Cache Coherence Protocol Model. In K. Jensen and G. Rozenberg, editors, High-level Petri Nets, Theory and Application. Springer-Verlag, 1991.Google Scholar
  7. [GHW94]
    H. J. Genrich, H.-M. Hanisch, and K. Wöllhaf. Verification of Recipe-based Control Procedures by Means of Predicate/Transition Nets. In R. Valette, editor, Proceedings of the 15th International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science, Zaragoza, Spain, 1994. Springer Verlag.Google Scholar
  8. [Gib85]
    A. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985.Google Scholar
  9. [GS92]
    H. J. Genrich and R. M. Shapiro. Formal Verification of an Arbiter Cascade. In K. Jensen, editor, Proceedings of the 13th International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science, Sheffield, UK, 1992. Springer Verlag.Google Scholar
  10. [Had91]
    S. Haddad. A Reduction Theory for Coloured Nets. In K. Jensen and G. Rozenberg, editors, High-level Petri Nets, Theory and Application. Springer-Verlag, 1991.Google Scholar
  11. [JCHH96]
    K. Jensen, S. Christensen, P. Huber, and M. Holla. Design/CPN. A reference manual. Computer Science Department, University of Aarhus, 1996. Online: http: //www.daimi. aau.dk/designCPN/.Google Scholar
  12. [Jen92]
    K. Jensen. Coloured Petri Nets — Basic Concepts, Analysis Methods and Practical Use. Volume 1, Basic Concepts. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1992.Google Scholar
  13. [Jen94]
    K. Jensen. Coloured Petri Nets — Basic Concepts, Analysis Methods and Practical Use. Volume 2, Analysis Methods. Monographs in Theoretical Computer Science. Springer-Verlag, 1994.Google Scholar
  14. [JM95]
    J.B. Jørgensen and K.H. Mortensen. Modelling and Analysis of Distributed Program Execution in BETA Using Coloured Petri Nets. Technical report, Computer Science Department, University of Aarhus, 1995.Google Scholar
  15. [MMPN93]
    O. L. Madsen, B. Møller-Pedersen, and K. Nygaard. Object-Oriented Programming in the BETA Programming Language. Addison Wesley, 1993.Google Scholar
  16. [MV92]
    W. M. McLendon, Jr. and R. F. Vidale. Analysis of an Ada System Using Coloured Petri nets and Occurrence Graphs. In K. Jensen, editor, Proceedings of the 13th International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science, Sheffield, UK, 1992. Springer Verlag.Google Scholar
  17. [Tan92]
    A. S. Tanenbaum. Modern Operating Systems. Prentice-Hall International, 1992.Google Scholar
  18. [Tok93]
    J. Toksvig. Tool Support for Place Flow Analysis of Hierarchical CP-nets Version 2.0. Technical report, Computer Science Department, University of Aarhus, 1993.Google Scholar
  19. [Ull93]
    J. D. Ullman. Elements of ML Programming. Prentice-Hall, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jens Bæk Jørgensen
    • 1
  • Kjeld Høyer Mortensen
    • 1
  1. 1.Computer Science DepartmentUniversity of AarhusAarhus CDenmark

Personalised recommendations