共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
In this paper, we present a Petri net-based approach for modeling the choreography of semantic Web services which are described following the OWL-S specification. In our approach, each control construct of the OWL-S choreography is represented through a Petri net pattern that captures formally its operational semantics. The main difference between our work and the main proposals that model the semantics of OWL-S services choreography is that, although both approaches represent the service choreography with Petri nets, our proposal is also concerned with the practical execution of the Petri nets by the client. Therefore we also represent the flow of data, the outputs transformations, the effects in the environment, in addition to the structures that control the choreography of the services in our Petri net models. The implementation of the OWL-S choreography is performed in a Petri net ontology-based engine. This is another difference with traditional approaches that only use Petri nets for the analysis of the service properties. Furthermore, the use of an underlying ontology engine for supporting both the domain models of OWL-S services and the Petri net models provides several advantages in terms of reasoning, extension, and reuse. 相似文献
3.
Petri net is used widely to analyze and model various systems formally. Recently, many Petri nets mania devote their efforts to enhancing and extending the expressive power of Petri nets. One such effort is to extend Petri nets with object-oriented concepts. An object-oriented paradigm provides excellent concepts to model real-world problems. Object-oriented concepts allow us to build software systems easily, intuitively, and naturally. Although several high-level Petri nets with the concept of objects are suggested, these nets do not fully support the object-oriented concepts. In this paper, we propose a hierarchical object-oriented Petri net (HOONet). The formal syntax and semantics of HOONet are explained in detail. HOONet supports a wide range of object-oriented features including abstract, encapsulated and modularized objects, object interaction by message passing, inheritance, and ploymorphism. HOONet also supports a variety of modeling and analysis mechanisms such as incremental modeling of evolving systems, unfolding the HOONet to lower level Petri net, and incremental reachability analysis for HOONet models. We demonstrate the usefulness of HOONet by applying it to modeling and analysis with an example. 相似文献
4.
Robert Lorenz Gabriel Juhás Robin Bergenthum Jörg Desel Sebastian Mauser 《Theoretical computer science》2009,410(12-13):1190-1216
In this paper, we show that it can be tested in polynomial time as to whether a scenario is an execution of a Petri net. This holds for a wide variety of Petri net classes, ranging from elementary nets to general inhibitor nets. Scenarios are given by causal structures expressing causal dependencies and concurrency among events. In the case of elementary nets and of place/transition nets, such causal structures are partial orders among transition occurrences. For several extended Petri net classes, the extension of partial orders to stratified order structures is considered.The algorithms are based on the representation of the non-sequential behavior of Petri nets by so-called token flow functions and a characterization of Petri net executions called token flow property. This property allows nontrivial transformations into flow optimization problems, which can be solved in polynomial time. The paper is a revised, consolidated and extended version of the conference papers [G. Juhás, R. Lorenz, J. Desel, Can I execute my scenario in your net?, in: G. Ciardo, P. Darondeau (Eds.), ICATPN, in: Lecture Notes in Computer Science, Springer, 2005, pp. 289–308; R. Lorenz, S. Mauser, R. Bergenthum, Testing the Executability of Scenarios in General Inhibitor Nets, in: ACSD, IEEE Computer Society, 2007, pp. 167–176] and includes parts of the habilitation thesis [R. Lorenz, Szenario-basierte Verifikation und Synthese von Perinetzen: Theorie und Anwendungen, Habilitation, 2006]. 相似文献
5.
D. A. Zaitsev 《Automation and Remote Control》2014,75(8):1369-1383
The paradigm of computations on the Petri nets was shown to appreciably speed up the computations and reduce laboriousness of software development owing to the mass parallelism and asynchronous information processing. A language of the programmed Petri nets was developed, alternative approaches to realizing the paradigm at the micro and macro levels were proposed, and the estimates of complexity of the earlier universal Petri net that are prototypes of the corresponding processor were specified. Indicated were the lines of practical realization of the paradigm such as the development of the technology of programming on the loaded Petri net, technology of translation of the loaded Petri nets to the inhibitory Petri nets, and the efficient hardware processors executing programs in the language of the inhibitory Petri nets. Fast computations are supported by the nets of the Sleptsov class with multiple start of transition at a step. 相似文献
6.
基于Petri网的FMS物流系统建模与仿真 总被引:3,自引:0,他引:3
在建立FMS物流系统Petri网模型的基础上,采用“映射”思想,将Petri网模型转化为物流系统的仿真程序,提出了库所映射为程序数据、变迁映射为程序函数、系统子网映射为FMS系统基本类的映射方法,通过实例仿真验证了软件程序与模型的一致性。 相似文献
7.
The concept of aspect-orientation allows for modularizing crosscutting concerns as aspect modules. Aspect-orientation originally
emerged at the programming level, and has stretched over other development phases now. Among them aspect-oriented modeling
(AOM) is a hot topic, and there are many approaches supporting it. Petri net is a good formalism which can provide the foundations
for modeling software and simulating its execution, but fails to resolve the problem of crosscutting concerns to support AOM.
So, this paper presents an approach which extends the Petri net so as to support the AOM. In this paper, the basic functions
of the system are modeled as base net by Petri net, and the crosscutting concerns are modeled as aspect nets. In order to
analyze the whole system, woven mechanism is proposed to compose the aspect nets and base net together. The problems about
aspectaspect conflict and conflict relations may exist among the aspect nets matching the shared join point, thus this paper
propose solutions to resolve them. The Object Petri net which is an extension of traditional Petri net is also extended so
as to support aspect-oriented modeling here. 相似文献
8.
Petri nets for protocol engineering 总被引:8,自引:0,他引:8
To-yat Cheung 《Computer Communications》1996,19(14):1250-1257
9.
The concept of aspect-orientation allows for modularizing crosscutting concerns as aspect modules. Aspect-orientation originally emerged at the programming level, and has stretched over other development phases now. Among them aspect-oriented modeling (AOM) is a hot topic, and there are many approaches supporting it. Petri net is a good formalism which can provide the foundations for modeling software and simulating its execution, but fails to resolve the problem of crosscutting concerns to support AOM. So, this paper presents an approach which extends the Petri net so as to support the AOM. In this paper, the basic functions of the system are modeled as base net by Petri net, and the crosscutting concerns are modeled as aspect nets. In order to analyze the whole system, woven mechanism is proposed to compose the aspect nets and base net together. The problems about aspect-aspect conflict and conflict relations may exist among the aspect nets matching the shared join point, thus this paper propose solutions to resolve them. The Object Petri net which is an extension of traditional Petri net is also extended so as to support aspect-oriented modeling here. 相似文献
10.
Rik Eshuis 《Formal Aspects of Computing》2013,25(5):659-681
Petri nets and statecharts can model concurrent systems in a succinct way. While translations from statecharts to Petri nets exist, a well-defined translation from Petri nets to statecharts is lacking. Such a translation should map an input net to a corresponding statechart, having a structure and behaviour similar to that of the input net. Since statecharts can only model a restricted form of concurrency, not every Petri net has a corresponding statechart. We identify a class of Petri nets, called statechartable nets, that can be translated to corresponding statecharts. Statechartable Petri nets are structurally defined using the novel notion of an area. We also define a structural translation that maps each statechartable Petri net to a corresponding statechart. The translation is proven sound and complete for statechartable Petri nets. 相似文献
11.
Chao D.Y. Wang D.T. 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》1997,27(6):962-977
We present two aspects of knitting technique, the structural properties (especially the P- and T-invariants), and the synchronized choice net (a new class of Petri net), that are of both theoretical importance and practical uses to the verification of structural correctness of a Petri net or to detect the structural problem of a Petri net. This work first proves that the ordinary Petri nets synthesized with knitting technique are structurally bounded, consistent, conservative and safe (when each home place holds one token) using the well-known linear algebra approach. It also provides a procedure for finding P- and T-invariants for Petri net synthesized using the knitting technique. We present examples for P-invariants and show that we can synthesize Petri nets more general than the "asymmetric-choice nets". The algorithm for finding P-invariants of ordinary Petri nets is extended to find the P-invariants for a general Petri net synthesized with knitting technique and the arc-ratio rules. We present a new class of Petri nets, called synchronized choice nets, which are the largest set of Petri nets that can be covered by both T-components and P-components. An algorithm is proposed to find its T-components and the P-components, respectively. The complexity of this algorithm is also presented. The theory of synchronized choice nets has the potential to simplify that for free choice nets. 相似文献
12.
Petri nets are fundamental to the analysis of distributed systems especially infinite-state systems. Finding a particular marking corresponding to a property violation in Petri nets can be reduced to exploring a state space induced by the set of reachable markings. Typical exploration(reachability analysis) approaches are undirected and do not take into account any knowledge about the structure of the Petri net. This paper proposes heuristic search for enhanced exploration to accelerate the search. For different needs in the system development process, we distinguish between different sorts of estimates.Treating the firing of a transition as an action applied to a set of predicates induced by the Petri net structure and markings, the reachability analysis can be reduced to finding a plan to an AI planning problem. Having such a reduction broadens the horizons for the application of AI heuristic search planning technology. In this paper we discuss the transformations schemes to encode Petri nets into PDDL. We show a concise encoding of general place-transition nets in Level 2 PDDL2.2, and a specification for bounded place-transition nets in ADL/STRIPS. Initial experiments with an existing planner are presented. 相似文献
13.
14.
Ian Gorton 《Concurrency and Computation》1993,5(2):87-104
Petri nets are proposed as a general-purpose design and modelling tool for parallel programs. The advantages of Petri nets for this purpose are discussed, and a solution to the Dining Philosophers problem is developed using simple Place-Transition nets. The limitations of Place-Transition nets are described, and the Dining Philosophers problem is used to illustrate how Coloured Petri nets can overcome these limitations. A more complex example of a Coloured Petri net is then given, and it is shown how a collection of processes in the Occam programming language can be developed directly from the properties of the net. Another Petri net model of a simple process farm is given, and a solution is developed in Parallel C: this further highlights the suitability of Petri nets as a design tool for parallel programs. 相似文献
15.
Petri网的组合积网及性能分析 总被引:2,自引:0,他引:2
李孝忠 《小型微型计算机系统》2002,23(1):98-100
Petri网是一种系统描述和分析的工具 .Petri网组合是由小系统的性质获得大系统性质的一种有效的分析方法 .本文提出了 Petri网的组合积运算 ,包括 Petri网的 型组合积运算和 型组合积运算、Petri网的并积运算 ,讨论了保持网的结构性质的条件 ,为复杂大系统的分析提供了新途径 相似文献
16.
K. Hasegawa P. E. Miyagi D. J. Santos Filho K. Takahashi L. Ma M. Sugisawa 《Journal of Intelligent and Robotic Systems》1999,26(3-4):423-437
PFS-R – Production Flow Schema with Resources – is a novel graphical representation for complex resource sharing discrete production systems proposed in this paper. The PFS-R is an augmented version of the PFS (Production Flow Schema, previously proposed by the authors) which includes correspondences of system resources at each production step. The PFS-R is able to model system structures as well as system behaviours in a more simplified and transparent manner than ordinary Petri net representations. That is, the PFS-R solves an important drawback when actually adopting Petri nets as a design technique for intelligent manufacturing systems. First, the paper introduces the basic elements of PFS-R, and the equivalent transformations of PFS-R model into hybrid nets and Petri nets, taking into account the net conservativeness. Next, examples of discrete production systems to illustrate the effectiveness of PFS-R are presented. In addition, it is shown, using an example, that the correspondence between resources and production steps in the process flow has a tree structure, which is an effective way to evaluate whether or not the objects designed have a well-defined structure. 相似文献
17.
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. 相似文献
18.
19.
20.