Formal modeling of synchronization methods for concurrent objects in Ada 95

  • Authors:

  • Ravi K. Gedela;Sol M. Shatz;Haiping Xu

  • Affiliations:

  • Dept. of EECS, Concurrent Software Lab, The University of Illinois at Chicago;Dept. of EECS, Concurrent Software Lab, The University of Illinois at Chicago;Dept. of EECS, Concurrent Software Lab, The University of Illinois at Chicago

  • Venue:
  • Proceedings of the 1999 annual ACM SIGAda international conference on Ada
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

One important role for Ada programming is to aid engineering of concurrent and distributed software. In a concurrent and distributed environment, objects may execute concurrently and need to be synchronized to serve a common goal. Three basic methods by which objects in a concurrent environment can be constructed and synchronized have been identified [1]. To formalize the semantics of these methods and to provide a formal model of their core behavior, we provide some graphic models based on the Petri net formalism. The purpose of this formal modeling is to illustrate the possibility of automatic program analysis for object-oriented features in Ada-95. Models for the three distributed- object synchronization methods are discussed, and a potential deadlock situation for one of the methods/models is illustrated. We conclude with some comparison of the three methods in terms of the model abstractions.