Abstract
A new method for expressing synchronization is presented which derives from several concepts in existing notational schemes. Synchronization conditions are expressed in terms of (integer) counters which are incorporated into the definitions of data objects shared by several asynchronous processes. It is shown that the method is at least as powerful as PV-type synchronization, and the solutions to some "classical" problems are presented using the notation.
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.
