共被期刊论文引用了4次
您的检索式：您选中1篇文献正在查看引证文献汇总
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | The Metaverse of Mind:Perspectives on DeSci for DeEco and DeSoc显示文摘First of all, I would like to take this opportunity to express my sincere and deep thanks to our Editor-in-Chief, Professor Meng Chu Zhou, who took over my position after I was drafted for rejuvenating IEEE Transactions on Computational Social Systems in 2017. During the past five years, Meng Chu’s professional leadership and dedication has transformed IEEE/CAA Journal of Automatica Sinica(JAS) from its infancy to a young and high-impact publication in the world that is full of vitality and actively engaged by a group of talented and charged associate Ei Cs and editors, which is clearly demonstrated in Meng Chu’s farewell editorial [1]. I am very glad that Professor Qing-Long Han, an influential and leading scientist of the world-class in AI, control, automation, and intelligent science and technology from Australia, as well as a staunch supporter and great leader of this journal from its beginning, will take over the Ei C torch from Meng Chu next year, since I am extremely confident that our journal will reach a new high for its service and quality under his new leadership. | Fei-Yue Wang | 2022 | IEEE/CAA Journal of Automatica Sinica2022，9，12： | 4 |
| 2 | Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches显示文摘A large amount of research has shown the vitality of siphon enumeration in the analysis and control of deadlocks in various resource-allocation systems modeled by Petri nets(PNs).In this paper,we propose an algorithm for the enumeration of minimal siphons in PN based on problem decomposition.The proposed algorithm is an improved version of the global partitioning minimal-siphon enumeration(GPMSE)proposed by Cordone et al.(2005)in IEEE Transactions on Systems,Man,and Cybernetics-Part A:Systems and Humans,which is widely used in the literature to compute minimal siphons.The experimental results show that the proposed algorithm consumes lower computational time and memory compared with GPMSE,which becomes more evident when the size of the handled net grows. | Dan You Oussama Karoui Shouguang Wang | 2022 | IEEE/CAA Journal of Automatica Sinica2022，9，2： | 1 |
| 3 | 标注Petri网的最小代价计划序列估计显示文摘针对制造系统的标注Petri网模型,提出一种基于回溯法估计系统最小代价计划序列的算法。已知标注Petri网模型的网结构与初始标识,根据给定的标注序列划分搜索阶段,每个标注对应的代价较小的变迁优先发生。按此规则观测到所有的标注后,对应的变迁发生序列代价的加和为最小总代价,并储存最小代价计划序列及总代价。按照深度优先策略遍历解空间树,以当前最小总代价为约束条件,剔除其他路径中不必搜索的标识以及变迁发生序列,缩小搜索空间。通过实例验证了该方法的可行性,与动态规划法执行结果相比,提出的方法能够实现更少的计算量和更高的工作效率。 | 周广瑞 徐淑琳 郭乙运 鲁法明 岳昊 | 2021 | 计算机科学与探索2021，15，7： | 0 |
| 4 | 具有不可靠资源柔性制造系统的鲁棒控制器设计显示文摘如果柔性制造系统包含不可靠资源,则在对系统进行控制器设计时,不仅要考虑由于资源分配不合理带来的死锁现象,还要考虑不可靠资源发生损坏带来的堵塞现象.对此,首先利用Petri网对具有不可靠资源的柔性制造系统进行建模,结合Petri网图形结构(资源变迁回路),模拟系统中的死锁和堵塞现象;然后,利用有效变迁覆盖的概念,为系统设计一种结构简单、鲁棒性强的Petri网控制器;最后,利用两个例子验证所设计控制器的有效性. | 刘慧霞 李俊红 王红梅 张雷 | 2022 | 控制与决策2022，37，8： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员