基于Time Petri Nets的实时系统资源冲突检测

Time Petri Nets在实时系统的建模和性能分析中得到广泛应用,而冲突是Petri网及其扩展模型的重要行为,解决冲突是正确分析模型动态行为的关键.目前随机Petri网、混合Petri网和区间速率连续Petri网的冲突检测方法由于没有考虑到时间约束因此无法在TPN网中使用.时间约束的引入使得Time Petri Nets模型的使能和触发语义比Petri网模型的语义复杂,冲突检测变得更加困难.为了计算冲突发生的时间和概率,首先根据时间约束,给出了变迁持续使能时延迟区间的计算方法,并证明了该方法的合理性和完备性;然后在此基础上定义并证明了Time Petri Nets模型中不冲突的检测方法;并提出了Time Petri Nets模型的冲突检测方法,给出了冲突时间区间和变迁实施概率的计算方法;最后通过实例验证说明了该方法的正确性和有效性.

基于Time Petri Net的实时系统冲撞检测与消解

time Petri net(TPN)在实时控制系统的建模中得到广泛应用,而冲撞是Petri网及其扩展模型的重要行为,解决冲撞是正确分析模型动态行为的关键.由于引入时间约束,使得TPN模型的使能和触发语义比Petri网模型的语义复杂,冲撞的检测及消解变得更加困难.首先根据时间约束,给出了变迁持续使能时延迟区间的计算方法,并证明了该方法的正确性;然后在此基础上定义并证明了TPN模型中冲撞的检测方法;给出了冲撞时间区间及修改时间约束的冲撞消解方法;最后通过实例验证说明了该方法的有效性和正确性.

基于Time Petri Nets的UML时序图分析

引入一种称为Clock的变迁,用来改进TPNs,讨论了如何将时序图转换为基于Clock变迁的TPNs,使这种TPNs能正确反映时序图的流程和时间约束。最后,利用普通Petri网的可达性分析技术对时序图模型进行了分析和验证。

Application Research of assembly line modeling based on Time Petri Net

With the continuous progress of manufacturing industry,automatic assembly line has become a very mature production mode in modern factories,and the quality of assembly line design has become an important issue related to the development of manufacturing enterprises.In this paper,a graphical model based on Petri Net is established for the first full load time of the assembly line.The accessibility of the P/T system and the production rhythm of the assembly line are calculated by computer simulation.Finally,according to the simulation model,an experimental platform is built to verify the rationality of the model.Experimental results show that the model can accurately express the equipment allocation process of assembly line.

Verifying Time Petri Nets by Linear Programming

The paper proposes an approach to solving some verification prob- lems of time Petri nets using linear programming. The approach is based on the observation that for loop-closed time Petri nets, it is only necessary to investigate a finite prefix of an untimed run of the underlying Petri net. Using the technique the paper gives solutions to reachability and bounded delay timing analysis problems. For both problems algorithms are given, that are decision procedures for loop-closed time Petri nets, and semi-decision procedures for general time Petri nets.

A Simulation Engine for Stochastic Timed Petri Nets and Application to Emergency Healthcare Systems

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.

The Relation between the Stabilization Problem for Discrete Event Systems Modeled with Timed Petri Nets via Lyapunov Methods and Max-Plus Algebra

A discrete event system is a dynamical system whose state evolves in time by the occurrence of events at possibly irregular time intervals. Timed Petri nets are a graphical and mathematical modeling tool applicable to discrete event systems in order to represent its states evolution where the timing at which the state changes is taken into consideration. One of the most important performance issues to be considered in a discrete event system is its stability. Lyapunov theory provides the required tools needed to aboard the stability and stabilization problems for discrete event systems modeled with timed Petri nets whose mathematical model is given in terms of difference equations. By proving stability one guarantees a bound on the discrete event systems state dynamics. When the system is unstable, a sufficient condition to stabilize the system is given. It is shown that it is possible to restrict the discrete event systems state space in such a way that boundedness is achieved. However, the restriction is not numerically precisely known. This inconvenience is overcome by considering a specific recurrence equation, in the max-plus algebra, which is assigned to the timed Petri net graphical model.

Timed Petri Net Models of Shared-Memory Bus-Based Multiprocessors

In shared-memory bus-based multiprocessors, when the number of processors grows, the processors spend an increasing amount of time waiting for access to the bus (and shared memory). This contention reduces the performance of processors and imposes a limitation of the number of processors that can be used efficiently in bus-based systems. Since the multi-processor’s performance depends upon many parameters which affect the performance in different ways, timed Petri nets are used to model shared-memory bus-based multiprocessors at the instruction execution level, and the developed models are used to study how the performance of processors changes with the number of processors in the system. The results illustrate very well the restriction on the number of processors imposed by the shared bus. All performance characteristics presented in this paper are obtained by discrete-event simulation of Petri net models.

USING COLORED-TIMED PETRI NET FOR THE SOLUTION OF DEADLOCK IN A FLEXIBLE ASSEMBLY SYSTEM

A colored timed Petri net(CTPN)modeling technique is developed for flexible assembly system(FAS) In particular,one section is devoted to the deadlock nodel based on the Petri net The rule of the deadlock error recovery is given Through the analysis of the behavioral properties of the FAS with the deadlock recovery model,the deadlock problem would be solved in the system.

Hierarchical Colored Timed Petri Nets for Maintenance Process Modeling of Civil Aircraft

Civil aircraft maintenance process simulation model is an effective method for analyzing the maintainability of a civil aircraft. First, we present the Hierarchical Colored Timed Petri Nets for maintenance process modeling of civil aircraft. Then, we expound a general method of civil aircraft maintenance activities, determine the maintenance level for decomposition, and propose the methods of describing logic of relations between the maintenance activities based on Petri Net. Finally, a time Colored Petri multi-level network modeling and simulation procedures and steps are given with the maintenance example of the landing gear burst tire of a certain type of aircraft. The feasibility of the method is proved by the example.

FINE-GRAINED DISTRIBUTED MULTIMEDIA SYNCHRONIZA-TION MODEL——ENHANCED FUZZY-TIMING PETRI NET

A fine grained distributed multimedia synchronization model——Enhanced Fuzzy timing Petri Net was proposed which is good at modeling indeterminacy and fuzzy. To satisfy the need of maximum tolerable jitter, the sufficient conditions are given in intra object synchronization. Method to find a proper granularity in inter object synchronization is also given to satisfy skew. Exceptions are detected and corrected as early as possible using restricted blocking method.

Verification of Session Initiation Protocol Using Timed Colored Petri Net

In this work, Session Initiation Protocol model is established by using Timed Colored Petri Nets (TCPN). SIP (Session Initiation Protocol) is a protocol developed to assist in providing advanced telephony services across the Internet. The Session Initiation Protocol (SIP) has become the quasi-standard for Voiceover-Internet Protocol (VoIP) communications. SIP is based on a client–server infrastructure in which user agents represent the end-terminals as clients, proxy servers handle SIP message routing between the user agents, and registrar servers store the client’s contact information into a location service. By use of timed color set and useful time attributes in tokens defined in CPN tools, timer and time-related problems of SIP are modeled and analyzed. Timer is an important part for SIP, especially the INVITE transaction.

Modeling of Fuel Elements Cycling System in Pebble Bed Reactor Based on Timed Places Control Petri Nets

Pebble bed reactors use cycling scheme of spherical fuel elements relying on fuel elements cycling system (FECS). The structure and control logic of FECS are very complex. Each control link has strict requirements on time and sequence. This increases the difficulties of description and analysis. In this paper, timed places control Petri nets (TPCPN) is applied for the modeling of FECS. On this basis the simulation of two important processes, namely uploading fuel elements into the core for the first time and emptying the core is finished by simulation software Arena. The results show that as TPCPN is able to describe different kinds of logic relationship and has time properties and control properties, it’s very suitable for the modeling and analysis of FECS.

基于Petri net建模的资源调度的蚁群算法

利用了受控赋时Petri net建立了分布式系统中的资源调度的模型,并应用仿真器进行了仿真。由于在进行大规模的模型分析时,不适合采用仿真器来模拟,因而引进了蚁群算法来优化模型,可以得到较好的结果。

Time Petri网在实时软件测试中的应用

针对实时软件传统测试方法的不足 ,提出了用TimePetri网来生成测试方案的方法。该方法很好地处理了与时间有关的不确定性问题 ,具体例子说明了其在实时软件测试中的应用。

一种基于时间权重的Petri Net工作流过程建模

为了研究Petri Net工作流模型的时间性能,首先给出了一种基于时间权重的工作流过程模型,此模型在变迁中引入时间,然后对此模型进行了时间性能分析,最后得出结论此模型在工作流的时间性能分析上是可行的.

双层变迁定时Petri Net抽象化

该文对双层变迁定时Petri Net进行了抽象化。抽象化的双层变迁定时Petri Net可用于嵌入式系统设计过程的中间态模拟。

基于Petri网的Internet多机器人协调控制器设计

基于Petri网库所不变量理论提出Internet多机器人协调控制模型,并利用此模型解决系统操作中的碰撞检测问题.通过对两个机器人协作空间进行网格划分,引入隐式、显式基本操作概念简化Petri网模型,从而增强了系统的灵活性;对操作中的异常情况进行分类,建立了故障恢复Petri网;利用库所不变量理论设计机器人协调控制器,规划多机器人协调动作.仿真实验表明,所提控制模型可以有效满足系统的安全性和实时性要求.

RECONFIGURABLE PRODUCTION LINE MODELING AND SCHEDULING USING PETRI NETS AND GENETIC ALGORITHM

In response to the production capacity and functionality variations, a genetic algorithm （GA） embedded with deterministic timed Petri nets（DTPN） for reconfigurable production line（RPL） is proposed to solve its scheduling problem. The basic DTPN modules are presented to model the corresponding variable structures in RPL, and then the scheduling model of the whole RPL is constructed. And in the scheduling algorithm, firing sequences of the Petri nets model are used as chromosomes, thus the selection, crossover, and mutation operator do not deal with the elements in the problem space, but the elements of Petri nets model. Accordingly, all the algorithms for GA operations embedded with Petri nets model are proposed. Moreover, the new weighted single-objective optimization based on reconfiguration cost and E/T is used. The results of a DC motor RPL scheduling suggest that the presented DTPN-GA scheduling algorithm has a significant impact on RPL scheduling, and provide obvious improvements over the conventional scheduling method in practice that meets duedate, minimizes reconfiguration cost, and enhances cost effectivity.

基于Petri网和改进遗传算法的多资源调度问题

针对混流装配线工序加工资源需求多样、工艺复杂、装配工期长等问题,采用Petri网和改进遗传算法对该问题进行优化求解。建立混流装配线赋时库所Petri网(timed place Petri net, TPPN)调度模型,基于模型激发序列,采用基于工序的编码方式进行染色体编码;采用精英保留策略选择优异个体,改进遗传算法的交叉、变异操作,用改进后的遗传算法求解混流装配线调度问题。通过对比案例及实例数据计算结果验证了方案的有效性。