Abstract
Many synchronization mechanisms have been designed specifically for Concurrent Object-Oriented Programming as e.g. in Guide [Dec89], ACT++ [Kaf89], DCST [Nak89], and Rosette [Tom89]). In this paper we will give an adaption of "synchronization counters" to the requirements of Object-Oriented Programming. Synchronization counters were introduced independently by Gerber [Ger77] and Robert, Verjus [Rob77]. They are used in the synchronization concept of activation conditions of the COOPL Guide [Dec89]. Although they have some nice properties as e.g. a highly expressive power, they at least do not meet the requirement of an OOPL that classes should be redefinable and extendable with a minimal amount of code. We present the concept of activation conditions in section 2 and discuss the strengths and shortcomings of synchronization counters. We will then refine the concept of synchronization counters to the concept "behavior counters". Here the strong relation of a synchronization counter to its method is replaced by a flexible relation of a behavior counter to a (redefinable) set of methods. It adopts the principle of behavior abstractions presented by Kafura and Lee in the Concurrent OOPL ACT++ [Kaf89].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
