This Article 
 Bibliographic References 
 Add to: 
Generating and Approximating Nondominated Coteries
September 1995 (vol. 6 no. 9)
pp. 905-914

Abstract—A coterie, which is used to realize mutual exclusion in a distributed system, is a family C of incomparable subsets such that every pair of subsets in C has at least one element in common. Associate with a family of subsets C a positive (i.e., monotone) Boolean function fC such that fC(x) = 1 if the Boolean vector x is equal to or greater than the characteristic vector of some subset in C, and 0 otherwise. It is known that C is a coterie if and only if fC is dual-minor, and is a nondominated (ND) coterie if and only if fC is self-dual.

In this paper, we introduce an operator ρ, which transforms a positive self-dual function into another positive self-dual function, and the concept of almost-self-duality, which is a close approximation to self-duality and can be checked in polynomial time (the complexity of checking positive self-duality is currently unknown). After proving several interesting properties of them, we propose a simple algorithm to check whether a given positive function is self-dual or not. Although this is not a polynomial algorithm, it is practically efficient in most cases. Finally, we present an incrementally polynomial algorithm that generates all positive self-dual functions (ND coteries) by repeatedly applying ρ operations. Based on this algorithm, all ND coteries of up to seven variables are computed.

[1] D. Agrawal and A. El Abbadi, “An Efficient and Fault-Tolerant Algorithm for Distributed Mutual Exclusion,” Proc. Eighth Ann. ACM Symp. Principles of Distributed Computing, pp. 193-200, 1989.
[2] D. Avis and K. Fukuda,“A pivoting algorithm for convex hulls and vertexenumeration of arrangements and polyhedra,” Discrete and Computational Geometry, vol. 8, pp. 295-313, 1992.
[3] D. Avis and K. Fukuda,“Reverse search for enumeration,” Research Report 92-5, Graduate School of Systems Management,Univ. of Tsukuba, 1992.
[4] D. Barbara and H. Garcia-Molina, "The Vulnerability of Vote Assignments," ACM Trans. Computer Systems, vol. 4, pp. 187-213, Aug. 1986.
[5] D. Barbara and H. Garcia-Molina, "The Reliability of Voting Mechanisms," IEEE Trans. Computers, vol. 36, pp. 1,197-1,208, Oct. 1987.
[6] L.J. Billera,“On the composition and decomposition of clutters,” J. Combinatorial Theory, vol. 11, pp. 234-245, 1971.
[7] J.C. Bioch,“Decompositions of coteries and Boolean functions,” Tech. Rept., Dept. of Computer Science No. 2, Erasmus Univ., Rotterdam, The Netherlands, Jan. 1993. A revised version also appeared in Proc. of Computing Science in The Netherlands CSN-93, pp. 75-86, Nov. 1993.
[8] J.C. Bioch and T. Ibaraki,“Decompositions of positive self-dual Boolean functions,” Discrete Math, vol. 140, pp. 23-46, 1995.
[9] J.C. Bioch and T. Ibaraki,“Complexity of identification and dualization ofpositive Boolean functions,” Report RRR25-93, RUTCOR, Rutgers Univ., July 1993. To appear in Infomation and Computation.
[10] J.C. Bioch and T. Ibaraki,“Generating and approximating ND coteries,” Report RRR42-94, RUTCOR, Rutgers Univ., Nov. 1994.
[11] E. Boros,P.L. Hammer,T. Ibaraki,, and K. Kawakami,“Identifying 2-monotonic positive Boolean functions in polynomial time,” ISA’91 Algorithms, W.L. Hsu and R.C.T. Lee, eds., Springer Lecture Notes in Computer Science 557, pp. 104-115, 1991.
[12] Y. Crama,“Dualization of regular Boolean functions,” Discrete Applied Math., vol. 16, pp. 79-85, 1987.
[13] S.B. Davidson,“Replicated data and partition failures,” S. Mullender ed., Distributed Systems, ch.13, Addison-Wesley, 1989.
[14] T. Eiter and G. Gottlob,“Identifying the minimal transversals of ahypergraph and related problems,” Tech. Report CD-TR 91/16, Christian Doppler Labor für Expertensysteme,Technische Universität Wien, Jan. 1991. To appear in SIAM J. Computing.
[15] H. Garcia-Molina and D. Barbara, “How to Assign Votes in a Distributed System,” J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[16] T. Ibaraki and T. Kameda, "A Theory of Coteries: Mutual Exclusion in Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 779-794, July 1993.
[17] T. Ibaraki,H. Nagamochi,, and T. Kameda,“Optimal coteries for rings andrelated networks,” Distributed Computing, vol. 8,. pp. 791-201, 1995.
[18] D.S. Johnson,M. Yannakakis,, and C.H. Papadimitriou,“On generating allmaximal independent sets,” Information Processing Letters, vol. 27, pp. 119-123, 1988.
[19] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[20] K. Makino and T. Ibaraki,“The maximum latency and identification ofpositive Boolean functions,” ISAAC 1994, Algorithms and Computation, D. Z. Du and X. S. Zhang, eds., Springer Lecture Notes in Computer Science, vol. 834, pp. 324-332, Aug. 1994.
[21] S. Muroga,Threshold Logic and Its Applications. Wiley-Interscience, 1971.
[22] S. Muroga,T. Tsuboi,, and C.R. Bauch,“Enumeration of threshold functionsof eight variables,” IEEE Trans. Computers, vol. 19, no. 9, pp. 818-825, 1970.
[23] M.L. Nielsen and M. Mizuno,“Coterie join algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 582-590, Sept. 1992.
[24] U.N. Peled and B. Simeone,“Polynomial-time algorithm for regularset-covering and threshold synthesis,” Discrete Applied Math., vol. 12, pp. 57-69, 1985.
[25] D. Peleg and A. Wool,“The availability of quorum systems,” Tech. Report CS93-17, The Weizmann Institute of Science, 1993.
[26] K.G. Ramamurthy,Coherent Structures and Simple Games. Kluwer, 1990.
[27] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.
[28] Z. Tong and R. Kain, "Vote Assignments in Weighted Voting Mechanisms," Proc. Seventh Symp. Reliable Distributed Systems, IEEE, Oct. 1988.
[29] I. Wegener,The Complexity of Boolean Functions. Wiley-Teubner, 1987.
[30] R.O. Winder,“Enumeration of seven-argument threshold functions,” IEEE Trans. Electronic Computers, vol. 14, no. 3, pp. 315-325, 1965.

Index Terms:
Almost-self-dual functions, coteries, dualization, monotone Boolean functions, mutual-exclusion, nondominated coteries, positive Boolean functions, self-dual functions.
Jan C. Bioch, Toshihide Ibaraki, "Generating and Approximating Nondominated Coteries," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 9, pp. 905-914, Sept. 1995, doi:10.1109/71.466629
Usage of this product signifies your acceptance of the Terms of Use.