About 60%of emissions into the earth’s atmosphere are produced by the transport sector,caused by exhaust gases from conventional internal combustion engines.An effective solution to this problem is electric mobility,...About 60%of emissions into the earth’s atmosphere are produced by the transport sector,caused by exhaust gases from conventional internal combustion engines.An effective solution to this problem is electric mobility,which significantly reduces the rate of urban pollution.The use of electric vehicles(EVs)has to be encouraged and facilitated by new information and communication technology(ICT)tools.To help achieve this goal,this paper proposes innovative services for electric vehicle users aimed at improving travel and charging experience.The goal is to provide a smart service to allow drivers to find the most appropriate charging solutions during a trip based on information such as the vehicle’s current position,battery type,state of charge,nearby charge point availability,and compatibility.In particular,the drivers are supported so that they can find and book the preferred charge option according to time availability and the final cost of the charge points(CPs).To this purpose,two virtual sensors(VSs)are designed,modeled and simulated in order to provide the users with an innovative service for smart CP searching and booking.In particular,the first VS is devoted to locate and find available CPs in a preferred area,whereas the second VS calculates the charging cost for the EV and supports the driver in the booking phase.A UML activity diagram describes VSs operations and cooperation,while a UML sequence diagram highlights data exchange between the VSs and other electromobility ecosystem actors(CP operator,EV manufacturer,etc.).Furthermore,two timed Petri Nets(TPNs)are designed to model the proposed VSs,functioning and interactions as discrete event systems.The Petri Nets are synchronized by a single larger TPN that is simulated in different use cases and scenarios to demonstrate the effectiveness of the proposed VSs.展开更多
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.展开更多
Petri net language is a powerful tool for describing dynamic behaviors of physical systems. However, it is not easy to obtain the language expression for a given Petri net especially a structure-complex net. In this p...Petri net language is a powerful tool for describing dynamic behaviors of physical systems. However, it is not easy to obtain the language expression for a given Petri net especially a structure-complex net. In this paper, we first analyze the behaviors of S-nets, which are structure-simple. With the decomposition method based on a given index function on the place set, a given structure-complex Petri net can be decomposed into a set of structure-simple S-nets. With the language relationships between the original system and the decomposed subnets, an algorithm to obtain the language expression of a given structure-complex net system is presented, which benefits the analysis of physical systems based on the Petri net language.展开更多
Petri Nets (PNs) are an effective structure for modeling and analyzing asynchronous systems with concurrent and parallel activities. A Petri net models the static properties of a discrete event system concentrating on...Petri Nets (PNs) are an effective structure for modeling and analyzing asynchronous systems with concurrent and parallel activities. A Petri net models the static properties of a discrete event system concentrating on two basic concepts: events and conditions. Most of the theoretical work on Petri nets is a formal definition of Petri nets structures, which consist of a set of places, representing conditions, a set of transitions, representing events, an input function and an output function. For practical purposes, a graphical representation is more useful. Two types of nodes portray places and transitions. A circle is a place and a bar is a transition. There is no inherent measure of time in a classical Petri net. To approach time-based evaluation of system performances, Timed Petri Nets (TPNs) were introduced. Modeling the notion of time is not straightforward. There are several possibilities for introducing time in PNs, among them timed transitions and timed places. This paper reviews several published examples where Petri Nets were used in different circumstances such as estimating expected utilization of processing resources at steady state in open queueing networks, verifying computerized simulations and batch planning in textile industry.展开更多
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模型的冲突检测方法,给出了冲突时间区间和变迁实施概率的计算方法;最后通过实例验证说明了该方法的正确性和有效性.展开更多
A color petri net (CPN) based attack modeling approach is addressed. Compared with graph-based modeling, CPN based attack model is flexible enough to model Internet intrusions, because of their static and dynamic feat...A color petri net (CPN) based attack modeling approach is addressed. Compared with graph-based modeling, CPN based attack model is flexible enough to model Internet intrusions, because of their static and dynamic features. The processes and rules of building CPN based attack model from attack tree are also presented. In order to evaluate the risk of intrusion, some cost elements are added to CPN based attack modeling. This extended model is useful in intrusion detection and risk evaluation. Experiences show that it is easy to exploit CPN based attack modeling approach to provide the controlling functions, such as intrusion response and intrusion defense. A case study given in this paper shows that CPN based attack model has many unique characters which attack tree model hasn’t.展开更多
time Petri net(TPN)在实时控制系统的建模中得到广泛应用,而冲撞是Petri网及其扩展模型的重要行为,解决冲撞是正确分析模型动态行为的关键.由于引入时间约束,使得TPN模型的使能和触发语义比Petri网模型的语义复杂,冲撞的检测及消解变...time Petri net(TPN)在实时控制系统的建模中得到广泛应用,而冲撞是Petri网及其扩展模型的重要行为,解决冲撞是正确分析模型动态行为的关键.由于引入时间约束,使得TPN模型的使能和触发语义比Petri网模型的语义复杂,冲撞的检测及消解变得更加困难.首先根据时间约束,给出了变迁持续使能时延迟区间的计算方法,并证明了该方法的正确性;然后在此基础上定义并证明了TPN模型中冲撞的检测方法;给出了冲撞时间区间及修改时间约束的冲撞消解方法;最后通过实例验证说明了该方法的有效性和正确性.展开更多
基金supported by the Italian project POR Puglia FESR 2014-2020“Research for Innovation(REFIN)”(8473A73)the MOST-Sustainable Mobility National Research Center,receiving funding from the European Union Next-GenerationEU(PIANO NAZIONALE DI RIPRESA E RESILIENZA(PNRR)–MISSIONE 4COMPONENTE 2,INVESTIMENTO 1.4-D.D.103317/06/2022,CN00000023)。
文摘About 60%of emissions into the earth’s atmosphere are produced by the transport sector,caused by exhaust gases from conventional internal combustion engines.An effective solution to this problem is electric mobility,which significantly reduces the rate of urban pollution.The use of electric vehicles(EVs)has to be encouraged and facilitated by new information and communication technology(ICT)tools.To help achieve this goal,this paper proposes innovative services for electric vehicle users aimed at improving travel and charging experience.The goal is to provide a smart service to allow drivers to find the most appropriate charging solutions during a trip based on information such as the vehicle’s current position,battery type,state of charge,nearby charge point availability,and compatibility.In particular,the drivers are supported so that they can find and book the preferred charge option according to time availability and the final cost of the charge points(CPs).To this purpose,two virtual sensors(VSs)are designed,modeled and simulated in order to provide the users with an innovative service for smart CP searching and booking.In particular,the first VS is devoted to locate and find available CPs in a preferred area,whereas the second VS calculates the charging cost for the EV and supports the driver in the booking phase.A UML activity diagram describes VSs operations and cooperation,while a UML sequence diagram highlights data exchange between the VSs and other electromobility ecosystem actors(CP operator,EV manufacturer,etc.).Furthermore,two timed Petri Nets(TPNs)are designed to model the proposed VSs,functioning and interactions as discrete event systems.The Petri Nets are synchronized by a single larger TPN that is simulated in different use cases and scenarios to demonstrate the effectiveness of the proposed VSs.
基金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.
基金This work was supported by the National Natural Science Foundation of China(No.60173053&No.60274063)the Excellent Young Scientist Foundation of Shandong Province of China(No.02BS069).
文摘Petri net language is a powerful tool for describing dynamic behaviors of physical systems. However, it is not easy to obtain the language expression for a given Petri net especially a structure-complex net. In this paper, we first analyze the behaviors of S-nets, which are structure-simple. With the decomposition method based on a given index function on the place set, a given structure-complex Petri net can be decomposed into a set of structure-simple S-nets. With the language relationships between the original system and the decomposed subnets, an algorithm to obtain the language expression of a given structure-complex net system is presented, which benefits the analysis of physical systems based on the Petri net language.
文摘Petri Nets (PNs) are an effective structure for modeling and analyzing asynchronous systems with concurrent and parallel activities. A Petri net models the static properties of a discrete event system concentrating on two basic concepts: events and conditions. Most of the theoretical work on Petri nets is a formal definition of Petri nets structures, which consist of a set of places, representing conditions, a set of transitions, representing events, an input function and an output function. For practical purposes, a graphical representation is more useful. Two types of nodes portray places and transitions. A circle is a place and a bar is a transition. There is no inherent measure of time in a classical Petri net. To approach time-based evaluation of system performances, Timed Petri Nets (TPNs) were introduced. Modeling the notion of time is not straightforward. There are several possibilities for introducing time in PNs, among them timed transitions and timed places. This paper reviews several published examples where Petri Nets were used in different circumstances such as estimating expected utilization of processing resources at steady state in open queueing networks, verifying computerized simulations and batch planning in textile industry.
文摘Time Petri Nets在实时系统的建模和性能分析中得到广泛应用,而冲突是Petri网及其扩展模型的重要行为,解决冲突是正确分析模型动态行为的关键.目前随机Petri网、混合Petri网和区间速率连续Petri网的冲突检测方法由于没有考虑到时间约束因此无法在TPN网中使用.时间约束的引入使得Time Petri Nets模型的使能和触发语义比Petri网模型的语义复杂,冲突检测变得更加困难.为了计算冲突发生的时间和概率,首先根据时间约束,给出了变迁持续使能时延迟区间的计算方法,并证明了该方法的合理性和完备性;然后在此基础上定义并证明了Time Petri Nets模型中不冲突的检测方法;并提出了Time Petri Nets模型的冲突检测方法,给出了冲突时间区间和变迁实施概率的计算方法;最后通过实例验证说明了该方法的正确性和有效性.
基金Supperted by the Nation High Technology Research and Development Program of China (863 Program) (No.2002AA001042) and the Tackle Key Problem Program of Sichuan Province (No. 01GG0712)
文摘A color petri net (CPN) based attack modeling approach is addressed. Compared with graph-based modeling, CPN based attack model is flexible enough to model Internet intrusions, because of their static and dynamic features. The processes and rules of building CPN based attack model from attack tree are also presented. In order to evaluate the risk of intrusion, some cost elements are added to CPN based attack modeling. This extended model is useful in intrusion detection and risk evaluation. Experiences show that it is easy to exploit CPN based attack modeling approach to provide the controlling functions, such as intrusion response and intrusion defense. A case study given in this paper shows that CPN based attack model has many unique characters which attack tree model hasn’t.
文摘time Petri net(TPN)在实时控制系统的建模中得到广泛应用,而冲撞是Petri网及其扩展模型的重要行为,解决冲撞是正确分析模型动态行为的关键.由于引入时间约束,使得TPN模型的使能和触发语义比Petri网模型的语义复杂,冲撞的检测及消解变得更加困难.首先根据时间约束,给出了变迁持续使能时延迟区间的计算方法,并证明了该方法的正确性;然后在此基础上定义并证明了TPN模型中冲撞的检测方法;给出了冲撞时间区间及修改时间约束的冲撞消解方法;最后通过实例验证说明了该方法的有效性和正确性.