As far as we know, the testing problem of legal firing sequence is NP-complete for gener-al Petri net, the related results of this problem on the polynomial-time solvability are limited only to some special net classe...As far as we know, the testing problem of legal firing sequence is NP-complete for gener-al Petri net, the related results of this problem on the polynomial-time solvability are limited only to some special net classes, such as persistent Petri nets, conflict-free Petri nets and state machine Petri nets. In this paper, the language properties of synchronous composition net are discussed. Based on these results, the testing algorithm polynomial-time complexity for legal firing sequence is proposed. Therefore, net classification of polynomial-time solvability for testing legal firing sequence is extended.展开更多
针对随机进程代数(stochastic process algebra,简称SPA)的基本模型方法、模型特点和该领域的主要研究成果进行了综述.比较了SPA和随机Petri网(stochastic Petri nets,简称SPN)之间的异同点,并讨论了SPA转化为相应SPN的语义和将SPA的研...针对随机进程代数(stochastic process algebra,简称SPA)的基本模型方法、模型特点和该领域的主要研究成果进行了综述.比较了SPA和随机Petri网(stochastic Petri nets,简称SPN)之间的异同点,并讨论了SPA转化为相应SPN的语义和将SPA的研究成果应用于SPN的方法.最后对SPA进一步研究工作的方向作了展望.展开更多
基金This work was supported by the National Natural Science Foundation of China (Grant Nos. 69973029 and 69933020) the National Key Basic Science Foundation of P. R. China (973 Project, Grant No. G1998030604) the Key Project of National Science & Techn
文摘As far as we know, the testing problem of legal firing sequence is NP-complete for gener-al Petri net, the related results of this problem on the polynomial-time solvability are limited only to some special net classes, such as persistent Petri nets, conflict-free Petri nets and state machine Petri nets. In this paper, the language properties of synchronous composition net are discussed. Based on these results, the testing algorithm polynomial-time complexity for legal firing sequence is proposed. Therefore, net classification of polynomial-time solvability for testing legal firing sequence is extended.
文摘针对随机进程代数(stochastic process algebra,简称SPA)的基本模型方法、模型特点和该领域的主要研究成果进行了综述.比较了SPA和随机Petri网(stochastic Petri nets,简称SPN)之间的异同点,并讨论了SPA转化为相应SPN的语义和将SPA的研究成果应用于SPN的方法.最后对SPA进一步研究工作的方向作了展望.
