Skip Navigation

The Computer Journal 1977 20(2):128-131; doi:10.1093/comjnl/20.2.128
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kammerer, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Excluding regions

P. Kammerer *

Institut fur Informatik II, Universitat Karlsruhe, Karlsruhe, Germany

To solve exclusion problems, a new structured synchronisation concept is introduced, called excluding region. It allows the explicit formulation of the exclusion relations in a system of parallel processes. In contrast to other constructs, it avoids the explicit use of counting variables, when different runs of the same program may run concurrently. This concept not only leads to simpler and clearer structured programs, but also allows compile time checks, as to whether systems of parallel processes behave in the way expected of them. This can be done by describing a process system by states and state transitions. As will be demonstrated by examples, the amount of states necessary to describe a system depends largely on the synchronisation primitives used. This indicates that in cases where the state representation method results in too many states, this may be due to inappropriate synchronisation primitives.

Received September 1975.

* Institut für Informatik II, Universität Karlsruhe, 75 Karlsruhe 1, Postfach 6380, West Germany


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.