This paper deals with the supervisory control problem of discrete event systems modeled by labeled Petri nets. The system is originally unbounded. First, the solvability of the problem is confirmed. A necessary condit...This paper deals with the supervisory control problem of discrete event systems modeled by labeled Petri nets. The system is originally unbounded. First, the solvability of the problem is confirmed. A necessary condition is given and proven for the existence of a feasible priority-based controller based on the notions of liveness and transition invariants. Next, a cyclic behavior graph is constructed, which shows the reachable markings that guarantee the maximum liveness of the system within a given bound vector. Finally, an on-line control strategy is proposed to enforce boundedness and liveness to the given system by appending priority relations to transitions. The dynamic priority relation changes flexibly according to the current state of the system and enforces the system evolving in a bounded and live manner. In addition, numerical examples are studied to verify the validity of the proposed approach that remains the structure of the plant net and is efficient for on-line control.展开更多
Time Petri Nets在实时系统的建模和性能分析中得到广泛应用,而冲突是Petri网及其扩展模型的重要行为,解决冲突是正确分析模型动态行为的关键.目前随机Petri网、混合Petri网和区间速率连续Petri网的冲突检测方法由于没有考虑到时间约束...Time Petri Nets在实时系统的建模和性能分析中得到广泛应用,而冲突是Petri网及其扩展模型的重要行为,解决冲突是正确分析模型动态行为的关键.目前随机Petri网、混合Petri网和区间速率连续Petri网的冲突检测方法由于没有考虑到时间约束因此无法在TPN网中使用.时间约束的引入使得Time Petri Nets模型的使能和触发语义比Petri网模型的语义复杂,冲突检测变得更加困难.为了计算冲突发生的时间和概率,首先根据时间约束,给出了变迁持续使能时延迟区间的计算方法,并证明了该方法的合理性和完备性;然后在此基础上定义并证明了Time Petri Nets模型中不冲突的检测方法;并提出了Time Petri Nets模型的冲突检测方法,给出了冲突时间区间和变迁实施概率的计算方法;最后通过实例验证说明了该方法的正确性和有效性.展开更多
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 exponent...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.展开更多
In many service delivery systems,the quantity of available resources is often a decisive factor of service quality.Resources can be personnel,offices,devices,supplies,and so on,depending on the nature of the services ...In many service delivery systems,the quantity of available resources is often a decisive factor of service quality.Resources can be personnel,offices,devices,supplies,and so on,depending on the nature of the services a system provides.Although service computing has been an active research topic for decades,general approaches that assess the impact of resource provisioning on service quality matrices in a rigorous way remain to be seen.Petri nets have been a popular formalism for modeling systems exhibiting behaviors of competition and concurrency for almost a half century.Stochastic timed Petri nets(STPN),an extension to regular Petri nets,are a powerful tool for system performance evaluation.However,we did not find any single existing STPN software tool that supports all timed transition firing policies and server types,not to mention resource provisioning and requirement analysis.This paper presents a generic and resource oriented STPN simulation engine that provides all critical features necessary for the analysis of service delivery system quality vs.resource provisioning.The power of the simulation system is illustrated by an application to emergency health care systems.展开更多
Determining the similarity degree between process models was very important for their management,reuse,and analysis.Current approaches either focused on process model's structural aspect,or had inefficiency or imp...Determining the similarity degree between process models was very important for their management,reuse,and analysis.Current approaches either focused on process model's structural aspect,or had inefficiency or imprecision in behavioral similarity.Aiming at these problems,a novel similarity measure which extended an existing method named Transition Adjacent Relation(TAR) with improved precision and efficiency named TAR * was proposed.The ability of measuring similarity was extended by eliminating the duplicate tasks without impacting the behaviors.For precision,TARs was classified into repeatable and unrepeatable ones to identify whether a TAR was involved in a loop.Two new kinds of TARs were added,one related to the invisible tasks after the source place and before sink place,and the other representing implicit dependencies.For efficiency,all TARs based on unfolding instead of its reach ability graph of a labeled Petri net were calculated to avoid state space explosion.Experiments on artificial and real-world process models showed the effectiveness and efficiency of the proposed method.展开更多
基金the Project of Industrial Internet and Integration of Industrialization and Industrialization of Guangxi,China under Grant No.Guigong2021-37.
文摘This paper deals with the supervisory control problem of discrete event systems modeled by labeled Petri nets. The system is originally unbounded. First, the solvability of the problem is confirmed. A necessary condition is given and proven for the existence of a feasible priority-based controller based on the notions of liveness and transition invariants. Next, a cyclic behavior graph is constructed, which shows the reachable markings that guarantee the maximum liveness of the system within a given bound vector. Finally, an on-line control strategy is proposed to enforce boundedness and liveness to the given system by appending priority relations to transitions. The dynamic priority relation changes flexibly according to the current state of the system and enforces the system evolving in a bounded and live manner. In addition, numerical examples are studied to verify the validity of the proposed approach that remains the structure of the plant net and is efficient for on-line control.
文摘Time Petri Nets在实时系统的建模和性能分析中得到广泛应用,而冲突是Petri网及其扩展模型的重要行为,解决冲突是正确分析模型动态行为的关键.目前随机Petri网、混合Petri网和区间速率连续Petri网的冲突检测方法由于没有考虑到时间约束因此无法在TPN网中使用.时间约束的引入使得Time Petri Nets模型的使能和触发语义比Petri网模型的语义复杂,冲突检测变得更加困难.为了计算冲突发生的时间和概率,首先根据时间约束,给出了变迁持续使能时延迟区间的计算方法,并证明了该方法的合理性和完备性;然后在此基础上定义并证明了Time Petri Nets模型中不冲突的检测方法;并提出了Time Petri Nets模型的冲突检测方法,给出了冲突时间区间和变迁实施概率的计算方法;最后通过实例验证说明了该方法的正确性和有效性.
基金supported by National Natural Science Foundation of China(61134007)National Basic Research Program of China(2013CB035406)
文摘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.
文摘In many service delivery systems,the quantity of available resources is often a decisive factor of service quality.Resources can be personnel,offices,devices,supplies,and so on,depending on the nature of the services a system provides.Although service computing has been an active research topic for decades,general approaches that assess the impact of resource provisioning on service quality matrices in a rigorous way remain to be seen.Petri nets have been a popular formalism for modeling systems exhibiting behaviors of competition and concurrency for almost a half century.Stochastic timed Petri nets(STPN),an extension to regular Petri nets,are a powerful tool for system performance evaluation.However,we did not find any single existing STPN software tool that supports all timed transition firing policies and server types,not to mention resource provisioning and requirement analysis.This paper presents a generic and resource oriented STPN simulation engine that provides all critical features necessary for the analysis of service delivery system quality vs.resource provisioning.The power of the simulation system is illustrated by an application to emergency health care systems.
基金Project supported by the National Science Foundation,China(No.61003099)the National Basic Research Program,China(No.2009CB320700)
文摘Determining the similarity degree between process models was very important for their management,reuse,and analysis.Current approaches either focused on process model's structural aspect,or had inefficiency or imprecision in behavioral similarity.Aiming at these problems,a novel similarity measure which extended an existing method named Transition Adjacent Relation(TAR) with improved precision and efficiency named TAR * was proposed.The ability of measuring similarity was extended by eliminating the duplicate tasks without impacting the behaviors.For precision,TARs was classified into repeatable and unrepeatable ones to identify whether a TAR was involved in a loop.Two new kinds of TARs were added,one related to the invisible tasks after the source place and before sink place,and the other representing implicit dependencies.For efficiency,all TARs based on unfolding instead of its reach ability graph of a labeled Petri net were calculated to avoid state space explosion.Experiments on artificial and real-world process models showed the effectiveness and efficiency of the proposed method.
