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.

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

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

基于优先级时间Petri网的实时嵌入式多核系统分析

已有的基于点区间优先级时间Petri网分析实时嵌入式多核系统的工作,存在以下不足:(1)点区间优先级时间Petri网只考虑每个任务的执行时间是一个固定值的情况,而更多的实际应用中每个任务的执行时间是在一个区间范围内,因此不能模拟这些应用;(2)没有实现从任务依赖图到点区间优先级时间Petri网的自动转化,不便于工程设计人员使用;(3)没有考虑任务间互斥访问共享变量的情况.为此,定义了优先级时间Petri网(Pri-TPN)以弥补第1个不足;定义带有资源分配与优先级的任务依赖图(TDG-RAP)以弥补第3个不足;给出从TDG-RAP到Pri-TPN的转化规则与算法以弥补第2个不足,以及基于Pri-TPN分析任务最坏执行时间与系统死锁的算法;开发工具软件,方便工程设计人员使用.

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.

基于标签时间Petri网最小初始状态的实时系统初始资源配置

针对实时系统完成特定任务序列的最少初始资源配置问题,本文研究了一种基于标签时间Petri网最小初始状态估计的解决方法.首先,对现有的标签Petri网的极小初始标识估计算法进行分析并提出改进方法,以适用于标签时间Petri网的极小初始标识的计算.其次,介绍一种基于路径(即变迁序列)的修正状态类图(MSCG).通过求解由路径MSCG的时间约束构建的线性规划问题,判定与极小初始状态相关的变迁序列是否与给定的时间标签序列一致.在此基础上,求出与时间标签序列相一致的极小初始状态集,并找出极小初始状态集中token总数最少的最小初始状态.最后,利用实例验证了所提方法的可行性和有效性.

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.

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网的电-气综合能源系统薄弱环节辨识

为有效辨识电-气综合能源系统薄弱环节,防止级联性重大事故,提出一种基于时间Petri网的电-气综合能源系统薄弱环节辨识方法。利用Petri网对系统做抽象化建模,确定故障源的关联区域子系统,并构建基于级联故障路径的时间Petri网模型,描述电-气系统故障传播的动态特性和时序差异,将级联危害评价计算融入到Petri网的运行过程中,寻找引发级联失效的关键环节,以IEEE30节点和25节点天然气系统组成的电-气耦合系统仿真分析,验证所提方法的有效性。

考虑行人影响的时延Petri网交叉口信号控制研究

论文基于时延Petri网(Timed Petri Net,TdPN)建立了一种考虑行人影响的可变相序信号控制模型,以有效缓解城市交叉口交通拥堵、车辆通行效率低下的问题。首先使用时延Petri网描述行人过街行为及其与车流冲突的过程,并对可变相序下车流受行人影响的配时进行决策,提出了一种滚动优化算法。该算法结合每个信号周期的车流与行人信息,按照先决策相序后决策配时的步骤对系统进行滚动优化,最终获得当前周期的最佳信号控制方案。通过将此模型与其他未虑行人影响的可变相序模型[12]和固定相序时延Petri网模型综合对比验证发现,该模型能有效缓解交通拥堵、提高交叉口的通行效率。

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.

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

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

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

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

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

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

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

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

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

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

基于平行Petri网的制造系统调度与控制一体化方法

为了消除制造系统调度层与控制层之间的隔阂,实现对生产事件快速灵活响应,本文提出了一种调度与控制一体化的方法.首先,定义了一种新型Petri网模型,即平行Petri网,从而集成地描述了传感器、执行器、任务和资源信息,构建制造系统的信息物理系统模型;其次,提出了一种从平行Petri网到赋时Petri网的抽象简化方法,大规模压缩优化调度所需搜索的状态空间;再次,定义了策略Petri网以描述最优调度策略.最后,给出了平行Petri网与策略Petri网同步执行算法,使得平行Petri网与物理系统同步执行.

Parametric Transformation of Timed Weighted Marked Graphs:Applications in Optimal Resource Allocation

Timed weighted marked graphs are a subclass of timed Petri nets that have wide applications in the control and performance analysis of flexible manufacturing systems.Due to the existence of multiplicities(i.e.,weights)on edges,the performance analysis and resource optimization of such graphs represent a challenging problem.In this paper,we develop an approach to transform a timed weighted marked graph whose initial marking is not given,into an equivalent parametric timed marked graph where the edges have unitary weights.In order to explore an optimal resource allocation policy for a system,an analytical method is developed for the resource optimization of timed weighted marked graphs by studying an equivalent net.Finally,we apply the proposed method to a flexible manufacturing system and compare the results with a previous heuristic approach.Simulation analysis shows that the developed approach is superior to the heuristic approach.