检索结果-南通市图书馆

Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2022年第2期9卷 329-338页

作者： Dan You Oussama Karoui shouguang wang IEEE School of Information and Electronic Engineering(Sussex Artificial Intelligence Institute) Zhejiang Gongshang UniversityHangzhou 310018China

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 *** 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 *** 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.

关键词： Index Terms-Petri nets(PNs) problem decomposition resource-allocation systems siphons

Macro liveness graph and liveness of ω-independent unbounded nets

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2015年第3期58卷 132-141页

作者： wang shouguang GAN MengDi ZHOU MengChu School of Information and Electronic Engineering Zhejiang Gongshang University Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

Liveness is a basic property of a system and the liveness issue of unbounded Petri nets remains one of the most difficult problems in this *** work proposes a novel method to decide the liveness of a class of unbounded generalized Petri nets calledω-independent unbounded nets,breaking the existing limits to one-place-unbounded *** algorithm to construct a macro liveness graph(MLG)is developed and a critical condition based on MLG deciding the liveness ofω-independent unbounded nets is *** are provided to demonstrate its effectiveness.

关键词： discrete event system(DES) Petri nets complex systems liveness property analysis

An Improved Approach to Test Diagnosability of Bounded Petri Nets

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2017年第2期4卷 297-303页

作者： Ning Ran Hongye Su shouguang wang State Laboratory of Industrial Control Technology Institute of Cyber-Systems and ControlZhejiang UniversityYuquan Campus IEEE School of Information & Electronic Engineering Zhejiang Gongshang University

For bounded Petri nets, Cabasino et al. propose a diagnosability test method that is based on the analysis of a modified basis reachability graph and a basis reachability diagnoser. However, its complexity is exponential in the number of nodes of the basis reachability diagnoser. In order to reduce the complexity of their method, this paper presents a new diagnosability test approach for bounded Petri nets. We present the concept of an extended basis reachability graph and prove that our approach is of polynomial complexity in the number of nodes of extended basis reachability graphs. An example is given to illustrate the application of the presented approach. © 2017 Chinese Association of Automation.

关键词： Failure analysis Fault detection Petri nets Testing

Bridge Bidding via Deep Reinforcement Learning and Belief Monte Carlo Search

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第10期11卷 2111-2122页

作者： Zizhang Qiu shouguang wang Dan You MengChu Zhou School of Information and Electronic Engineering Zhejiang Gongshang UniversityHangzhou 310018China IEEE

Contract Bridge,a four-player imperfect information game,comprises two phases:bidding and *** computer programs excel at playing,bidding presents a challenging aspect due to the need for information exchange with partners and interference with communication of *** this work,we introduce a Bridge bidding agent that combines supervised learning,deep reinforcement learning via self-play,and a test-time search *** experiments demonstrate that our agent outperforms WBridge5,a highly regarded computer Bridge software that has won multiple world championships,by a performance of 0.98 IMPs(international match points)per deal over 10000 deals,with a much cost-effective *** performance significantly surpasses previous state-of-the-art(0.85 IMPs per deal).Note 0.1 IMPs per deal is a significant improvement in Bridge bidding.

关键词： Contract Bridge reinforcement learning search

New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2018年第12期61卷 193-195页

作者： shouguang wang Dan YOU Mengchu ZHOU Department of Electronic and Information Engineering Zhejiang Gongshang University Department of Electrical and Computer Engineering New Jersey Institute of Technology

Dear editor,Analysis of reachability sets is of fundamental importance for a Petri net (PN). A reachability set can be represented by a reachability tree (RT),which is a powerful tool for intuitively checking the properties of PNs. Thus, properly construction of an RT is critical. Actually, constructing RTs to exactly characterize reachability sets for

关键词： NRT New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2015年第4期2卷 345-352页

作者： shouguang wang Mengdi Gan Mengchu Zhou Dan You School of Information and Electronic Engineering Zhejiang Gongshang University State Key Laboratory for Manufacturing Systems Engineering Xi’an Jiaotong University Ministry of Education(MoE)Key Laboratory of Embedded System and Service Computing Tongji University MoE Key Laboratory of Embedded System and Service Computing Tongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size. © 2014 Chinese Association of Automation.

关键词： Petri nets

Computation of an Emptiable Minimal Siphon in a Subclass of Petri Nets Using Mixed-Integer Programming

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2021年第1期8卷 219-226页

作者： shouguang wang Wenli Duo Xin Guo Xiaoning Jiang Dan You Kamel Barkaoui MengChu Zhou the School of Information and Electronic Engineering Zhejiang Gongshang UniversityHangzhou 310018China the Macao Institute of Systems Engineering Macao University of Science and TechnologyMacao 999078China the Department of Computer Science Conservatoire National des Arts et MétiersParis 75141France the Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA the Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and Systems Macao University of Science and TechnologyMacao 999078China

Deadlock resolution strategies based on siphon control are widely *** computational efficiency largely depends on siphon ***-integer programming(MIP)can be utilized for the computation of an emptiable siphon in a Petri net(PN).Based on it,deadlock resolution strategies can be designed without requiring complete siphon enumeration that has exponential *** to this reason,various MIP methods are proposed for various subclasses of *** work proposes an innovative MIP method to compute an emptiable minimal siphon(EMS)for a subclass of PNs named S^(4)*** particular,many particular structural characteristics of EMS in S4 PR are formalized as constraints,which greatly reduces the solution *** results show that the proposed MIP method has higher computational ***,the proposed method allows one to determine the liveness of an ordinary S^(4)PR.

关键词： Automated manufacturing systems deadlocks discrete event system mixed-integer programming(MIP) Petri nets(PN) siphons

在线全文

学校读者我要写书评

暂无评论

百年大党坚持自我革命的历史演进

山东社会科学 2022年第7期 119-126页

作者：王守光中共山东省委党校(山东行政学院)马克思主义学院山东济南250103

坚持自我革命,是百年大党在推进党的建设伟大工程实践中生成和铸就的最鲜明品格、最大优势和历史经验。百年来,中国共产党在不同历史时期,适应中国社会革命、建设、改革和自身建设需要,坚持真理、修正错误,以主动解决自身问题为导向,着... 详细信息

坚持自我革命,是百年大党在推进党的建设伟大工程实践中生成和铸就的最鲜明品格、最大优势和历史经验。百年来,中国共产党在不同历史时期,适应中国社会革命、建设、改革和自身建设需要,坚持真理、修正错误,以主动解决自身问题为导向,着重思想建党、党要管党、从严治党、全面从严治党,一脉相承而又与时俱进地坚持把百年大党自我革命不断推向深入,以伟大自我革命引领伟大社会革命并取得伟大成就,为党和人民事业长盛不衰、不断发展提供了根本保证,使党在革命性锻造中更加坚强。

关键词：百年大党自我革命历史演进

颗粒断层黏滑运动特征及水对其影响的试验研究

在线全文

学校读者我要写书评

暂无评论

岩石力学与工程学报 2019年第A1期38卷 2636-2645页

作者：吕征杨强王守光清华大学水沙科学与水利水电工程国家重点实验室北京100084

研究模拟断层黏滑运动中断层剪切位移、厚度和摩擦因数的演化特征对于理解地震周期的全过程有深刻的意义。采用钠钙细研磨球型玻璃珠,研究模拟断层在双直剪仪器下产生的黏滑现象。结果表明,每个黏滑周期中,断层首先经历一段弹性加载,之... 详细信息

研究模拟断层黏滑运动中断层剪切位移、厚度和摩擦因数的演化特征对于理解地震周期的全过程有深刻的意义。采用钠钙细研磨球型玻璃珠,研究模拟断层在双直剪仪器下产生的黏滑现象。结果表明,每个黏滑周期中,断层首先经历一段弹性加载,之后加载逐渐转变为非弹性,直到摩擦因数达到临界值,断层发生滑动破坏,并在破坏之后开始进入下一黏滑周期。研究采用变速度步方法,在同一试验中采用3～300μm/s的速度步,得出该模拟断层的速率和状态相关摩擦参数A-B为-0.005～-0.006,确为速度弱化。研究采用50%和100%的环境湿度进行对比试验,结果表明较高湿度对黏滑幅度和重现时间存在等比放大的作用,即湿度越高,黏滑段摩擦因数的增落幅值越大,黏滑周期越长。研究对进入稳定蠕滑状态的断层进行蒸馏水注入试验,发现对于处在黏滑与蠕滑临界态的颗粒断层,水的注入可以将断层滑动模式由稳定的蠕滑改变为非稳定的黏滑。

关键词：土力学颗粒材料双直剪试验黏滑运动速度弱化湿度