Cart (Loading....) | Create Account
Close category search window
 

An efficient algorithm for finding all maximal conflict sets in concurrent programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Hiraishi, K. ; Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan

Conflict is one of the fundamental situations that appear in concurrent programs. Conflict occurs when more than one processes share common resources. An occurrence of the action of one process disables actions of other processes which are in conflict. Controlling conflicts is very important in concurrent programming, especially for rule-based programming. We can find all conflicts by generating the state space, but largeness of the state space make this difficult. In this paper, we show an efficient algorithm to find all maximal conflict sets in concurrent programs. The proposed algorithm is based on partial order methods, and generates a reduced state space that preserves all maximal conflict sets

Published in:

Software Engineering for Parallel and Distributed Systems, 1997. Proceedings., Second International Workshop on

Date of Conference:

17-18 May 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.