A characterization of the stochastic process underlying astochastic Petri net

Stochastic Petri nets (SPN's) with generally distributed firing times can model a large class of systems, but simulation is the only feasible approach for their solution. We explore a hierarchy of SPN classes where modeling power is reduced in exchange for an increasingly efficient solution. Generalized stochastic Petri nets (GSPN's), deterministic and stochastic Petri nets (DSPN's), semi-Markovian stochastic Petri nets (SM-SPN's), timed Petri nets (TPN's), and generalized timed Petri nets (GTPN's) are particular entries in our hierarchy. Additional classes of SPN's for which we show how to compute an analytical solution are obtained by the method of the embedded Markov chain (DSPN's are just one example in this class) and state discretization, which we apply not only to the continuous-time case (PH-type distributions), but also to the discrete case     

New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets

Timed Petri nets are useful in performance evaluation of concurrent systems. The maximum computation rate is achieved for minimal cycle time of timed Petri net. It is known that minimal cycle time problem for P-invariant Petri nets is NP-complete. In this paper we prove that the minimal cycle time problem, for non-P-invariant Petri nets and for a small subclass of P-invariant Petri nets called free-choice nets having live and safe marking, is NP-complete.     

Markovian timed Petri nets for performance analysis ofsemiconductor manufacturing systems

A subclass of generalized stochastic Petri nets (GSPNs) with priorities, called Markovian timed Petri nets, are proposed to model semiconductor manufacturing systems that consider process priorities, routing priorities, resource re-entrance, and nonpreemptive operations. Uniformization technique is used to establish both lower and upper bounds of the performance of interest. These bounds are computable using linear programming. Numerical experiments have been conducted to evaluate the accuracy of the bounds using models adapted from real-world systems. The experiments show that the upper bounds are very close to the simulation results. Thus, performance measures can be accurately estimated using these bounds.     

Piecewise constant timed continuous PNs for the steady state estimation of stochastic PNs

Reliability analysis is often based on stochastic discrete event models like Markov models or stochastic Petri nets. For complex dynamical systems with numerous components, analytical expressions of the steady state are tedious to work out because of the combinatory explosion with discrete models. The computation of numerical approximations is also time consuming due to the slow convergence of stochastic simulations. For these reasons, fluidification can be investigated to estimate the asymptotic behaviour of stochastic processes. The contributions of this paper are to point out that timed continuous Petri nets may lead to biased estimators of the stochastic steady state and to introduce fluid Petri nets with piecewise-constant maximal firing speeds and sufficient conditions in order to obtain unbiased estimators.     

Timed Petri Nets in Hybrid Systems: Stability and Supervisory Control

In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in dealing with concurrency and complexity issues. A brief overview of existing results on hybrid systems that are based on Petri nets is first presented. A class of timed Petri nets named programmable timed Petri nets (PTPN) is then used to model hybrid systems. Using the PTPN, the stability and supervisory control of hybrid systems are addressed and efficient algorithms are introduced. In particular, we present sufficient conditions for the uniform ultimate boundness of hybrid systems composed of multiple linear time invariant plants which are switched between using a logical rule described by a Petri net. This paper also examines the supervisory control of a hybrid system in which the continuous state is transfered to a region of the state space in a way that respects safety specifications on the plant's discrete and continuous dynamics.     

基于随机Petri网的性能与可靠性评价

近年来,随机Petri网在柔性制造系统、计算机及通信系统等领域的性能与可靠性评价中得到了广泛的应用。文章首先介绍了性能与可靠性评价,然后回顾了广义随机Petri网及其状态空间爆炸问题,最后讨论了非马尔科夫随机Petri网。     

基于Uppaal的时延Petri网到时间自动机等价模型验证*

时延Petri网和时间自动机都可以有效地对实时系统的行为进行模拟和性能分析。利用时延Petri网到时间自动机等价转换算法（简记作TPN-to-TA 转换）,将一个描述实时系统的时延Petri网模型转换成与其语义等价的一组时间自动机模型。使用时间自动机中成熟的模型验证工具Uppaal对此时延Petri网的模型进行验证。     

Correctness verification and performance analysis of real-time systems using stochastic preemptive time Petri nets

Time Petri nets describe the state of a timed system through a marking and a set of clocks. If clocks take values in a dense domain, state space analysis must rely on equivalence classes. These support verification of logical sequencing and quantitative timing of events, but they are hard to be enriched with a stochastic characterization of nondeterminism necessary for performance and dependability evaluation. Casting clocks into a discrete domain overcomes the limitation, but raises a number of problems deriving from the intertwined effects of concurrency and timing. We present a discrete-time variant of time Petri nets, called stochastic preemptive time Petri nets, which provides a unified solution for the above problems through the adoption of a maximal step semantics in which the logical location evolves through the concurrent firing of transition sets. We propose an analysis technique, which integrates the enumeration of a succession relation among sets of timed states with the calculus of their probability distribution. This enables a joint approach to the evaluation of performance and dependability indexes as well as to the verification of sequencing and timeliness correctness. Expressive and analysis capabilities of the model are demonstrated with reference to a real-time digital control system.     

Deadlock-Freeness Analysis of Continuous Mono-T-Semiflow Petri Nets

Most verification techniques for highly populated discrete systems suffer from the state explosion problem. The “fluidification” of discrete systems is a classical relaxation technique that aims to avoid the state explosion problem. Continuous Petri nets are the result of fluidifying traditional discrete Petri nets. In continuous Petri nets the firing of a transition is not constrained to the naturals but to the non-negative reals. Unfortunately, some important properties, as liveness, may not be preserved when the discrete net model is fluidified. Therefore, a thorough study of the properties of continuous Petri nets is required. This paper focuses on the study of deadlock-freeness in the framework of mono-T-semiflow continuous Petri nets, i.e., conservative nets with a single repetitive sequence (T-semiflow). The study is developed both on untimed and timed systems. Topological necessary conditions are extracted for this property. Moreover, a bridge relating deadlock-freeness conditions for untimed and timed systems is established.     

Complex-valued token Petri nets

This paper presents a new extension to ordinary Petri nets (PNs) that uses complex-valued tokens. By allowing two kinds of tokens, "real" and "imaginary," each place marking contains both quantity and type information. Complex-valued token PNs were designed to integrate seamlessly with other popular Petri net extensions such as timed nets, stochastic nets, and colored nets. This simple and intuitive application of complex numbers and complex arithmetic to PNs provides a unique modeling tool. Some examples show the capabilities of this proposed class of PNs. Note to Practitioners-Discrete-event systems are often man-made systems such as transportation systems, computer communication networks, distributed software, and manufacturing systems. They typically involve the flow of information and physical goods through a network. The flow itself evolves in continuous time but the initiation or completion of the event happens at a discrete point in time. Analyzing the system's performance is key to their successful operation. This paper presents a new approach to performance analysis with application to supply-chain management.     

离散时间Petri网的模糊模型

离散时间Petri网是一种系统模拟和分析的有效工具，它可以结合图形和分析描述评估离散事件系统的动态执行．基于T—S模糊模型，提出用于描述离散时间Petri网的模糊模型，讨论该模型适应于TtPNs的情况，用以推广文章结论，并且给出用于TtPNs的线性模糊控制规则．同时，文章还给出TtPNs聚合的结论．     

Estimation of the firing frequencies in discrete and continuous Petri nets models

Production frequencies provide useful information for performance analysis, monitoring and control applications of manufacturing systems. However, such frequencies are not always measurable. In this case, they must be estimated from the observation of other variables. This paper deals with production frequencies estimation for systems modelled by discrete or continuous Petri nets. For this purpose, the content of the buffers is measured on-line with a sampling period, and the evolution equations of the model are reversed. In the case of timed Petri nets, the production frequencies estimation is obtained from the approximation of the firing sequences and in the case of continuous Petri nets it results directly from the variations of the marking vector. The exact and approximated solutions of the estimation problem are described. Accuracy of the estimation is related to measurement error, Petri net structure and sampling period. Moreover, when the estimation provides several solutions, the Petri net model is extended such that a unique solution is obtained.     

基于时延Petri网的DEDS的代数模型

用一种新的算子建立了结构无竞争时延Petri网和资源分配型时延Petri网的动态方程,为该类系统的分析和控制提供了研究工具.     

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网的鲁棒性研究

研究一类可以用(max,min,+)等代数运算描述的具有约束的赋时Petri网的性能鲁棒性.首先给出了此类Petri网的统一的代数描述,并将性能鲁棒性问题形式化.接着给出了参数区间摄动情形下性能保持鲁棒性的一个充分条件.对于仅包含(min,+)和(min,max)运算的特殊情形,得到了参数区间摄动情形下性能保持鲁棒性的充分必要条件.     

Modeling and performance evaluation of supply chains using batch deterministic and stochastic Petri nets

Batch deterministic and stochastic Petri nets are introduced as a tool for modeling and performance evaluation of supply chains. The new model is developed by enhancing deterministic and stochastic Petri nets (DSPNs) with batch places and batch tokens. By incorporating stochastic Petri nets (SPNs) with the batch features, inhibitor arcs, and marking-dependent weights, operational policies of supply chains such as inventory policies can be easily described in the model. Methods for structural and performance analysis of the model are developed by extending existing ones for DSPNs. As applications, an inventory system and an industrial supply chain are modeled and their performances are evaluated analytically and by simulation, respectively, using this BSPN model. The applications demonstrate that our model and associated methods can solve some important supply chain modeling and analysis issues. Note to Practitioners-This paper was motivated by the problem of performance analysis and optimization of supply chains but it also applies to other discrete event systems where materials are processed in finite discrete quantities (batches) and operations are performed in a batch way because of batch inputs and/or in order to take advantages of the economies of scale. Existing Petri net modeling and analysis tools for such systems ignore their batch features, making their modeling complicated. This paper suggests a new model called batch deterministic and stochastic Petri nets (BDSPNs) by enhancing deterministic and stochastic Petri nets with batch places and batch tokens. Methods for structural and performance analysis of the model are developed. We then show how an inventory system and a real-life supply chain can be modeled and their performances can be evaluated analytically and by simulation respectively based on the model. The model and associated analysis methods therefore provide a promising tool for modeling and performance evaluation of supply chains.     

Timed high-level nets

Petri nets have been widely used for modeling and analyzing concurrent systems. Several reasons contribute to their success: the simplicity of the model, the immediate graphical representation, the easy modeling of asynchronous aspects, the possibility of reasoning about important properties such as reachability, liveness, boundedness. However, the original model fails in representing two important features: complex functional aspects, such as conditions which rule the flow of control, and time. Due to that, two different classes of extensions of Petri nets have been proposed: high-level nets and timed Petri nets. High-level nets allow the representation of functional aspects in full details, but do not provide a means for representing time; on the other hand, timed Petri nets have been thought for time representation, but they do not provide a means for representing detailed functinal aspects. Thus, these two important aspects cannot be mastered together. In particular, it is difficult to express relationships between time and functional aspects.This paper investigates the relationships between high-level nets and timed Petri nets, thus extending a first set of results published in a previous paper, where a unifying Petri net based model for time representation has been proposed. It first recalls how time can be represented in a Petri net extension called ER nets, and assesses its generality. It then investigates the relationships of ER nets with the best known high-level nets. In particular it shows the overall equivalence of ER nets, Colored Petri nets and Predicate/Transition nets, and extends the mechanism for time representation introduced in ER nets to both Colored Petri nets and Predicate/Transition nets. It also shows that these models cannot be simplified without significantly constraining the timing aspects that can be modeled.