arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.3307cs.DBcs.FLcs.SE
收藏

函数依赖规则自动证明生成器的着色Petri网建模

Modelling an Automatic Proof Generator for Functional Dependency Rules Using Colored Petri Net

Saeid Pashazadeh, Maryam Pashazadeh

摘要:

数据库管理员需要计算函数依赖闭包(FD)来规范数据库系统和执行完整性规则。有色Petri网(CPN)是一种有效的形式化建模和验证方法.在本文中,我们模拟阿姆斯特朗的公理自动证明生成一个新的FD规则从初始FD规则使用CPN。为此,阿姆斯特朗公理的CPN模型提出和初始FD考虑在模型中作为初始色集。然后通过模型检验在模型的状态空间中搜索所需的FD。如果它存在于状态空间中,则递归ML代码使用在模型的状态空间中的进一步搜索来提取该FD规则的证明。

英文摘要:

Database administrators need to compute closure of functional dependencies (FDs) for normalization of database systems and enforcing integrity rules. Colored Petri net (CPN) is a powerful formal method for modelling and verification of various systems. In this paper, we modelled Armstrong's axioms for automatic proof generation of a new FD rule from initial FD rules using CPN. For this purpose, a CPN model of Armstrong's axioms presents and initial FDs considered in the model as initial color set. Then we search required FD in the state space of the model via model checking. If it exists in the state space, then a recursive ML code extracts the proof of this FD rule using further searches in the state space of the model.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑