检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王标[1] 王萃 WANG Biao;WANG Cui(Qufu Normal University,Shandong 273165,China)
机构地区:[1]曲阜师范大学,山东273165
出 处:《电子技术(上海)》2022年第1期74-77,共4页Electronic Technology
摘 要:针对档案归并流程动态建模容易引发流程逻辑混乱,造成归并流程无法正确执行的问题,提出一种基于逻辑Petri网建模的档案归并流程合理性验证方法。将流程健壮性转化为路径可达问题,给出了一种基于路径规约的健壮性判定方法。设计了档案归并流程健壮性判定算法,给出了判定实例,该方法避免传统Petri网方法进行可达判定时面临的状态空间爆炸问题,提高档案归并流程健壮性判定的效率。Dynamic modeling of the file merging process is easy to lead to the confusion of the process logic in archives management.It may result in the merge process cannot be executed correctly.A method to verify the soundness of file merging process based on logic Petri net is proposed in this paper.Soundness of file merging process is transformed into path reachability problem.A path specification-based method to check the soundness of file merging process is provided.Algorithm for soundness checking is designed and examples for soundness verification are also given.The proposed method avoids the state space explosion problem of traditional Petri net method in reachability judgment,and improves the efficiency of file merging process robustness judgment.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.141.192.51