Extending commitment protocol with binary domain to partially ordered domain

A group of processes have to commit to realize distributed applications. The processes exchange values with the other processes to make the commitment. The processes commit if every process takes one value. In the traditional commitment protocols, only two values, i.e. commit or abort can be taken. In this paper we discuss a more general domain including multiple values. In addition, the domain is partially ordered by a dominant relation which shows what values the processes can take after taking a value. Each process decides what value to be taken after taking one value by rising the dominant relation. In this paper we discuss how to reach commitment in a group of multiple processes by using the dominant relation