Abstract: This paper attempts to deal with model of Granular Computing theory. Starting with granular set, it defines the generalization-specialization relationship between the individual objects of a granule, the pan-inclusion relationship between the granules, and proves?that they are?the?partial ordering relation, and the granular set?with partial order relation is a category. Offering the pan-intersection operation?of the granular set, it further illustrates the construction method of?granular?category based on partial ordering relation. It also discusses some properties of the?granular?category. The research results show that the method is effective to construct the?granular?category, laying the foundation for the application of the?granular?category.

Key words: granule, granular set, granular category, partial ordering relation, construction, Granular Computing（GrC）

摘要： 目前粒计算理论还没有公认的统一模型，为了解决这个问题，从粒集出发，定义了粒的个体对象间的泛化-例化关系、粒之间的泛包含关系，证明了它们都是偏序关系且具有偏序关系的粒集是一个范畴；定义了粒集的泛交运算，并通过实例给出了基于偏序关系的粒范畴的构造方法，讨论了这种粒范畴的几个性质。这些研究成果说明了基于偏序关系的粒范畴的构造方法是行之有效的，为研究粒范畴的应用问题奠定了基础。

关键词: 粒, 粒集, 粒范畴, 偏序关系, 构造, 粒计算