共查询到20条相似文献,搜索用时 31 毫秒
1.
Liveness is one of the most important properties of the Petri net analysis. This property is concerned with a capability for firing of transitions. On the other hand, place-liveness is another notion related to liveness, which is concerned with a capability for having tokens in places. Concerning these liveness and place-liveness problems, this paper suggests a new subclass of Petri net, ‘POC nets’, as a superclass of AC nets and DC nets. For this subclass, the equivalence between liveness and place-liveness is shown and a sufficient condition for liveness for this POC net is derived. Then the results are extended to liveness problem of timed Petri nets which have transitions with finite firing durations and the earliest firing rule. Although liveness of a (non-timed) Petri net is neither necessary nor sufficient condition for liveness of a timed Petri net, it is shown that liveness is preserved if the net has POC structure. Furthermore, it is pointed out that if a POC net satisfies some additional condition, Petri net liveness is equivalent to timed Petri net liveness. Finally, it is shown that liveness of timed POC nets with TC structure and the earliest firing rule is decidable with deterministic polynomial time complexity. 相似文献
2.
基于Petri网语言的并发系统性质研究 总被引:3,自引:1,他引:3
给出Petri网弱活性(无死锁)与活性的两个语言刻画,讨论了同步合成Petri网的语言性质,基于Petri网语言,给出了判定Petri网活性的充分必要条件。同时研究了Petri网同步合成过程中活性保持问题,给出保持活性的充分必要条件。这些结果为讨论网的活性测试和控制提供了形式语言的方法。 相似文献
3.
4.
Modeling and analysis of timed Petri nets using heaps of pieces 总被引:1,自引:0,他引:1
The authors show that safe timed Petri nets can be represented by special automata over the (max, +) semiring, which compute the height of heaps of pieces. This extends to the timed case the classical representation a la Mazurkiewicz of the behavior of safe Petri nets by trace monoids and trace languages. For a subclass including all safe free-choice Petri nets, we obtain reduced heap realizations using structural properties of the net (covering by safe state machine components). The authors illustrate the heap-based modeling by the typical case of safe jobshops. For a periodic schedule, the authors obtain a heap-based throughput formula, which is simpler to compute than its traditional timed event graph version, particularly if one is interested in the successive evaluation of a large number of possible schedules 相似文献
5.
时延Petri网和时间自动机都可以有效地对实时系统的行为进行模拟和性能分析。利用时延Petri网到时间自动机等价转换算法(简记作TPN-to-TA 转换),将一个描述实时系统的时延Petri网模型转换成与其语义等价的一组时间自动机模型。使用时间自动机中成熟的模型验证工具Uppaal对此时延Petri网的模型进行验证。 相似文献
6.
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches 总被引:2,自引:0,他引:2
Bernard Berthomieu Didier Lime Olivier H. Roux François Vernadat 《Discrete Event Dynamic Systems》2007,17(2):133-158
Several extensions of Time Petri nets (TPNs) have been proposed for modeling suspension and resumption of actions in timed systems. We first introduce a simple class of TPNs extended with stopwatches (SwTPNs), and present a semi-algorithm for building exact representations of the behavior of SwTPNs, based on the known state class method for Time Petri nets. Then, we prove that state reachability in SwTPNs and all similar models is undecidable, even when bounded, which solves an open problem. Finally, we discuss overapproximation methods yielding finite abstractions of their behavior for a subclass of bounded SwTPNs, and propose a new one based on a quantization of the polyhedra representing temporal information. By adjusting a parameter, the exact behavior can be approximated as closely as desired. The methods have been implemented, experiments are reported. 相似文献
7.
8.
结构活性作为Petri网的重要结构性质,在Petri网活性判定领域具有较高的研究价值。从Petri网有向回路对结构活性的影响入手,分析与判定无冲突Petri网的结构活性,讨论库所元素及其后置变迁之间是否存在有向回路对Petri网结构活性的影响,研究该类Petri网结构活性判定方法的相关条件与结论,得到无冲突Petri网是满足结构活性的充分必要条件。分析结果表明,该判定方法可在多项式时间内判定无冲突Petri网的结构活性。 相似文献
9.
活性和有界性是网系统的重要行为特性.从分解以及尽可能简单分解的角度得到了非对称选择网的一个子类,可分解非对称选择网(简称DAC网),证明了DAC网系统活性的充分必要条件,同时给出了DAC网系统活性有界性的充分必要条件,也进一步讨论了判定一个Petri网系统是否是活的有界的DAC网系统的多项式算法. 相似文献
10.
Petri网的活性反映了实际系统的元死锁性.本文讨论了一类结构简单的Petri网-T-网的活性问题,给出了各类T-网的活性判定定理并给出了判定算法.算法主要计算工作是变迁的前序库所集和后继变迁集以及回路的判断,这三个过程实际上是一个树的搜索过程,因此算法易于实现,判定效率也大大提高. 相似文献
11.
寻找实际可行的多项式算法一直是Petri网应用的重要方面.给出了关于扩展强化非对称选择网(extended strong asymmetric choice nets,简称ESAC网)结构活和结构有界的一个判定算法.该算法可简单、有效地测试结构活结构有界的ESAC网的初始标识是否是活标识.ESAC网覆盖了自由选择网,因此,该算法应用范围较为广泛. 相似文献
12.
研究了顺序资源共享分配系统的建模模型S4PR (Systems of sequential systems with shared resources)网的活性问题. 已有的研究成果表明, 一个S4PR网在所有信标都满足max, max'或max"-controlled 时能保持活性, 但现有的活性条件对信标的限制严格且不适用于某些网系统, 本文提出了一类名为max*-controlled的改进型条件, 并证明了当一个S4PR网的所有信标都满足max*-controlled条件时, 网系统能保持活性. 与现有的其他条件相比, 新的活性条件更加宽松, 为设计更高允许度的死锁预防或者活性保持监控器提供了理论支撑. 相似文献
13.
《Automatic Control, IEEE Transactions on》2006,51(9):1472-1481
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. 相似文献
14.
Structural analysis is one of the most important and efficient methods to investigate the behaviour of Petri nets. Liveness is a significant behavioural property of Petri nets. Siphons, as structural objects of a Petri net, are closely related to its liveness. Many deadlock control policies for flexible manufacturing systems (FMS) modelled by Petri nets are implemented via siphon control. Most of the existing methods design liveness-enforcing supervisors by adding control places for siphons based on their controllability conditions. To compute a liveness-enforcing supervisor with as much as permissive behaviour, it is both theoretically and practically significant to find an exact controllability condition for siphons. However, the existing conditions, max, max′, and max″-controllability of siphons are all overly restrictive and generally sufficient only. This paper develops a new condition called max*-controllability of the siphons in generalised systems of simple sequential processes with resources (GS3PR), which are a net subclass that can model many real-world automated manufacturing systems. We show that a GS3PR is live if all its strict minimal siphons (SMS) are max*-controlled. Compared with the existing conditions, i.e., max-, max′-, and max″-controllability of siphons, max*-controllability of the SMS is not only sufficient but also necessary. An example is used to illustrate the proposed method. 相似文献
15.
Xenofon D. Koutsoukos Kevin X. He Michael D. Lemmon Panos J. Antsaklis 《Discrete Event Dynamic Systems》1998,8(2):137-173
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. 相似文献
16.
Hsu-Chun Yen 《Acta Informatica》1998,35(8):673-688
A number of problems concerning priority conflict-free Petri nets are investigated in this paper. We show the reachability problem for such Petri nets to be NP-complete. (Using a similar technique, the NP-completeness result applies to the class
of priority BPP-nets as well.) As for the boundedness problem, an NP-completeness result is demonstrated for priority conflict-free Petri nets with two types of prioritized transitions.
(In contrast, the problem is known to be P-complete for conflict-free Petri nets without priorities.) We also investigate
the home state problem, i.e., the problem of determining whether home states exist in a given a Petri net, for conflict-free Petri nets
with and without priorities. As it turns out, home states always exist for bounded conflict-free Petri nets without priorities.
If an additional liveness constraint is imposed, such Petri nets are guaranteed to be ‘reversible’ (i.e., their initial states
are home states). For priority conflict-free Petri nets, being bounded and live is sufficient for the existence of home states.
However, if the liveness assumption is dropped, the existence of home states is no longer guaranteed.
Received: 1 April 1997 / 8 December 1997 相似文献
17.
18.
To solve the problem of deadlock prevention for timed Petri nets, an effective deadlock prevention policy based on elementary siphons is proposed in this paper. Without enumerating reachable markings, deadlock prevention is achieved by adding monitors for elementary siphons, increasing control depth variables when necessary, and removing implicit, liveness‐restricted and redundant control places. The final supervisor is live. First, a timed Petri net is stretched into a stretched Petri net (SPN). Unchanging the system performance, each transition in the SPN has a unit delay time. Then the siphon‐control‐based approach is applied. Monitors computed according to the marking constraints are added to the SPN model to ensure all strict minimal siphons in the net invariant‐controlled. A liveness‐enforcing supervisor with simple structure can be obtained by reverting the SPN into a TdPN. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society 相似文献
19.
Timed high-level nets 总被引:2,自引:1,他引:1
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. 相似文献
20.
Fuzzy multimodel of timed Petri nets 总被引:1,自引:0,他引:1
Hennequin S. Lefebvre D. El Moudni A. 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2001,31(2):245-251