scispace - formally typeset
Search or ask a question

Showing papers on "Process architecture published in 2011"


Journal ArticleDOI
TL;DR: This paper proposes a novel hierarchical method to construct large Petri nets from a number of smaller Petrinets that can be created separately by different domain experts that is demonstrated by a proof-of-concept Python program.
Abstract: This paper investigates the use of Petri nets for modeling coordinated cyber-physical attacks on the smart grid. Petri nets offer more flexibility and expressiveness than traditional attack trees to represent the actions of simultaneous attackers. However, Petri net models for attacks on very large critical infrastructures such as the smart grid require a great amount of manual effort and detailed expertise in cyber-physical threats. To overcome these obstacles, we propose a novel hierarchical method to construct large Petri nets from a number of smaller Petri nets that can be created separately by different domain experts. The construction method is facilitated by a model description language that enables identical places in different Petri nets to be matched. The new modeling approach is described for an example attack on smart meters, and its efficacy is demonstrated by a proof-of-concept Python program.

239 citations


Book
27 May 2011
TL;DR: An introduction to the modeling of business information systems, with processes formally modeled using Petri nets, is presented.
Abstract: An introduction to the modeling of business information systems, with processes formally modeled using Petri nets

220 citations


Journal ArticleDOI
TL;DR: The approach is based on the notion of basis markings and justifications and it can be applied both to bounded and unbounded Petri nets whose unobservable subnet is acyclic, and it is shown that the most burdensome part of the procedure may be moved off-line.

160 citations


Book ChapterDOI
06 Sep 2011
TL;DR: This work provides declarative semantics more suitable for process mining, and relates causal nets to Petri nets to clarify these semantics and to illustrate the non-local nature of this new representation.
Abstract: Process discovery--discovering a process model from example behavior recorded in an event log--is one of the most challenging tasks in process mining. The primary reason is that conventional modeling languages (e.g., Petri nets, BPMN, EPCs, and ULM ADs) have difficulties representing the observed behavior properly and/or succinctly. Moreover, discovered process models tend to have deadlocks and livelocks. Therefore, we advocate a new representation more suitable for process discovery: causal nets. Causal nets are related to the representations used by several process discovery techniques (e.g., heuristic mining, fuzzy mining, and genetic mining). However, unlike existing approaches, we provide declarative semantics more suitable for process mining. To clarify these semantics and to illustrate the non-local nature of this new representation, we relate causal nets to Petri nets.

95 citations


Journal ArticleDOI
20 Apr 2011
TL;DR: The paper proposes a novel approach to certify the compliance of business processes with regulatory requirements that translates process models into their corresponding Petri net representations and checks them against requirements also expressed in this formalism.
Abstract: A key problem in the deployment of large-scale, reliable cloud computing concerns the difficulty to certify the compliance of business processes operating in the cloud. Standard audit procedures such as SAS-70 and SAS-117 are hard to conduct for cloud-based processes. The paper proposes a novel approach to certify the compliance of business processes with regulatory requirements. The approach translates process models into their corresponding Petri net representations and checks them against requirements also expressed in this formalism. Being based on Petri nets, the approach provides well-founded evidence on adherence and, in case of noncompliance, indicates the possible vulnerabilities.

64 citations


Book ChapterDOI
20 Jun 2011
TL;DR: A tool, ISTA (Integration and System Test Automation), for automated test generation and execution by using high-level Petri nets as finite state test models, useful not only for function testing but also for security testing by using Petrinets as threat models.
Abstract: Automated software testing has gained much attention because it is expected to improve testing productivity and reduce testing cost. Automated generation and execution of tests, however, are still very limited. This paper presents a tool, ISTA (Integration and System Test Automation), for automated test generation and execution by using high-level Petri nets as finite state test models. ISTA has several unique features. It allows executable test code to be generated automatically from a MID (Model-Implementation Description) specification - including a high-level Petri net as the test model and a mapping from the Petri net elements to implementation constructs. The test code can be executed immediately against the system under test. It supports a variety of languages of test code, including Java, C/C++, C#, VB, and html/Selenium IDE (for web applications). It also supports automated test generation for various coverage criteria of Petri nets. ISTA is useful not only for function testing but also for security testing by using Petri nets as threat models. It has been applied to several industry-strength systems.

58 citations


Journal ArticleDOI
TL;DR: This paper proposes a method to synthesize a cost-effective supervisor with the aid of a set of mathematical programming formulations and shows some results by investigating timed Petri nets, which can be utilized to make a good tradeoff between implementation cost and system cycle time.
Abstract: For automated manufacturing systems (AMSs), deadlock resolution in terms of Petri nets remains an attractive topic to which many approaches are dedicated. However, few of them can quantitatively optimize certain indices during their supervisor synthesis process. This causes unnecessary control limitations and often leads to high implementation cost. In the framework of Petri nets, this paper proposes a method to synthesize a cost-effective supervisor with the aid of a set of mathematical programming formulations. Along the same vein, we also show some results by investigating timed Petri nets, which can be utilized to make a good tradeoff between implementation cost and system cycle time. Examples are used to validate the effectiveness of our result.

58 citations


Journal ArticleDOI
TL;DR: It is shown that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets.
Abstract: In [19], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets. Moreover, we salvage almost all of Yen's results by defining a fragment of this class of formulas for which the satisfiability problem is EXPSPACE-complete by adapting his proof.

49 citations


DOI
01 Jan 2011
TL;DR: This PhD thesis proposes a framework for the execution of process mining workflows in a distributed environment and provides a formal description of a grid architecture suitable for process mining experiments in terms of a colored Petri net (CPN).
Abstract: Process mining has emerged as a way to analyze systems and their actual use based on the event logs they produce. The focus of process mining, unlike other business intelligence domains, is on concurrent processes and not on static or mainly sequential structures. Process mining is applicable to a wide range of systems. These systems may be pure information systems (e.g., ERP systems) or systems where the hardware plays a more prominent role (e.g., embedded systems). The only requirement is that the system produces event logs, thus recording (parts of) the actual behavior. Current Process Mining Algorithms (PMAs) face two major challenges: 1) real-life event logs contain large amounts of data about previous executions of a process, and 2) since they attempt to derive accurate information from the event logs, PMAs are computational expensive. Moreover, process mining experts often combine multiple PMAs to offer insights into systems real behavior from different perspectives, i.e. they execute process mining workflows. These workflows are currently executed manually sequentially or are hard-coded. In the past decade, new emerging concepts such as grid computing, service-oriented architectures and cloud computing provide solutions to the increasing demand for data storage and computing power. These technologies enable worldwide distributed resources, e.g. software and infrastructure, to cooperate for a specific user defined goal. Such distributed environments can, on one hand, offer a solution to the complexity challenges of the process mining domain and, on the other hand, create the possibility to enable PMAs as services that can be combined and orchestrated via workflow engines. This PhD thesis proposes a framework for the execution of process mining workflows in a distributed environment. The distribution of the PMAs is done at two levels: 1) process mining algorithms are parallelized, thus reducing considerably their time consumption; and 2) a framework for automated execution of process mining workflows is proposed. For the first level, we focus on one particular advanced process mining algorithm - Genetic Mining Algorithm (GMA), and we propose two distribution strategies Distributed Genetic Mining Algorithm (DGMA) and Distributed Sample-based Genetic Mining Algorithm (DSGMA), improving significantly the GMA time efficiency. DGMA distributes the GMA computation on different computational resources by using a coarsegrained approach. The second strategy, DSGMA further reduces the computation time by data distribution and exploiting the event logs redundancy. For both of the algorithms, we derive guidelines for their parameter configuration based on empirical evaluations; we validate the guidelines on several real life event logs. All the proposed algorithms described in this thesis have been implemented as plug-ins in the ProM framework - an open source tool available at www.processmining.org. For the second level, we provide a formal description of a grid architecture suitable for process mining experiments in terms of a colored Petri net (CPN). The CPN can be seen as a reference model for grids and clarifies the basic concepts at a conceptual level. Moreover, the CPN allows for various kinds of analysis ranging from verification to performance analysis. The level of detail present in the CPN model allows us to, almost straightforwardly; implement a real grid architecture based on the model. Note that even if our reference model was inspired by the challenges from process mining domain challenges, it can be used for other computationally challenging domains as well. Based on the CPN reference model we implemented a prototype, called YAGA (Yet Another Grid Architecture), a service-based framework for supporting process mining experiments. YAGA is a simple, but extensible, grid architecture that combines a powerful workflow engine YAWL and the ProM framework through a JAVA-based grid middleware. By combining the CPN reference model and YAGA, we provide a powerful grid framework for process mining experiments. The model allows for easy experimentation and extensive debugging. It also ensures an easy and rapid way to choose optimal parameters of real life workflows. These estimations can help users in planning their experiments and/or re-configuring their workflows. Moreover, performing model simulations on-the-fly can give realistic resource load predictions, which can be used for improving the scheduling process.

47 citations


Journal ArticleDOI
TL;DR: This paper introduces an automatic Web service composition method based on logical inference of Horn clauses and Petri nets, to determine whether the composite service exists in time that is linear in the size of the knowledge base.
Abstract: This paper introduces an automatic Web service composition method based on logical inference of Horn clauses and Petri nets. The Web service composition problem is transformed into the logical inference problem of Horn clauses by exploring the dependency relations among services. An algorithm is presented, to determine whether the composite service exists in time that is linear in the size of the knowledge base. It can also return the rule set necessary for the composition. Petri nets are chosen to model the rule set and its structural analysis techniques are used to obtain the composite service.

46 citations


Journal ArticleDOI
TL;DR: In this paper, the authors classify Petri net applications for supply chain management (SCM) into three categories: competitive strategy, firm focused tactics, and operational efficiency, according to the decision problems facing SCM.
Abstract: Supply networks are discrete event dynamic systems consisting of suppliers, manufacturers, distributors, and customers. It is a difficult and challenging task to model such a complex system. Recently, characterised as being capable of model parallelism and synchronisation, Petri nets (PNs) have attracted great attention for modelling and studying a supply network. Since each type of Petri net has its unique properties to model specific applications, this paper reviews and classifies Petri net applications for supply chain management (SCM). According to the decision problems facing SCM, we have the Petri net applications classified into three areas: competitive strategy, firm focused tactics, and operational efficiency. Categorising the Petri net applications will provide a guideline to industry practitioners and research academics to choose the appropriate Petri net for the problem. In addition, the paper attempts to offer future directions in applying the Petri net to SCM including: (1) modelling with un...

Journal ArticleDOI
01 Aug 2011
TL;DR: The Algebraic Petri Nets Analyzer (AlPiNA), a symbolic model checker for High-level Petri nets, is introduced, comprised of two independent modules: a GUI plug-in for Eclipse and an underlying model checking engine.
Abstract: Although model checking is heavily used in the hardware domain, it did not take off in software engineering yet. One of the possible reasons is that software models are very complex. They integrate many dimensions such as data types and concurrency, leading to the infamous state space explosion problem. This article introduces the Algebraic Petri Nets Analyzer (AlPiNA), a symbolic model checker for High-level Petri nets. It is comprised of two independent modules: a GUI plug-in for Eclipse and an underlying model checking engine. AlPiNA is a step towards performing efficient and user-friendly model checking of large software systems. This is achieved by separating the model and its properties from the optimisation artifacts. This article describes the features that AlPiNA provides to the user for designing models and verifying properties. It also presents the techniques and artifacts used for tuning verification performance, along with some theoretical background.

Book ChapterDOI
20 Jun 2011
TL;DR: The extent to which the Petri net approach can be used as an umbrella formalism to support the process of BioModel Engineering includes the facilitation of an active and productive interaction between biomodellers and bioscientists during the construction and analysis of dynamic models of biological systems.
Abstract: "How might Petri nets enhance my Systems Biology toolkit?" - this is one of the questions that we get on a regular basis, which motivated us to write an answer in the form of this paper. We discuss the extent to which the Petri net approach can be used as an umbrella formalism to support the process of BioModel Engineering. This includes the facilitation of an active and productive interaction between biomodellers and bioscientists during the construction and analysis of dynamic models of biological systems. These models play a crucial role in both Systems Biology, where they can be explanatory and predictive, and synthetic biology, where they are effectively design templates. In this paper we give an overview of the tools and techniques which have been shown to be useful so far, and describe some of the current open challenges.

Journal ArticleDOI
TL;DR: The fact that both language equivalence and bisimulation equivalence are undecidable for unbounded labelled Petri nets might be seen as an indication that non-interference properties based on these equivalences cannot be decided, but it is proved the opposite, providing results of decidability of non-Interference over a representative class of infinite state systems.
Abstract: Non-interference, in transitive or intransitive form, is defined here over unbounded (Place/Transition) Petri nets. The definitions are adaptations of similar, well-accepted definitions introduced earlier in the framework of labelled transition systems. The interpretation of intransitive non-interference which we propose for Petri nets is as follows. A Petri net represents the composition of a controlled and a controller systems, possibly sharing places and transitions. Low transitions represent local actions of the controlled system, high transitions represent local decisions of the controller, and downgrading transitions represent synchronized actions of both components. Intransitive non-interference means the impossibility for the controlled system to follow any local strategy that would force or dodge synchronized actions depending upon the decisions taken by the controller after the last synchronized action. The fact that both language equivalence and bisimulation equivalence are undecidable for unbounded labelled Petri nets might be seen as an indication that non-interference properties based on these equivalences cannot be decided. We prove the opposite, providing results of decidability of non-interference over a representative class of infinite state systems.

Book ChapterDOI
14 Nov 2011
TL;DR: This paper shows how SPLs can be modelled in an incremental, modular fashion using a formal method based on Petri nets, and continues the work on Feature Petri Nets, a lightweight extension to Petrinets, by presenting a framework for modularly constructing FeaturePetri Nets to model SPLs.
Abstract: Formal modelling and verification are critical for managing the inherent complexity of systems with a high degree of variability, such as those designed following the software product line (SPL) paradigm. SPL models tend to be large--the number of products in an SPL can be exponential in the number of features. Modelling these systems poses two main challenges. Firstly, a modular modelling formalism that scales well is required. Secondly, the ability to analyse and verify complex models efficiently is key in order to ensure that all products behave correctly. The choice of a system modelling formalism that is both expressive and well-established is therefore crucial. In this paper we show how SPLs can be modelled in an incremental, modular fashion using a formal method based on Petri nets. We continue our work on Feature Petri Nets, a lightweight extension to Petri nets, by presenting a framework for modularly constructing Feature Petri Nets to model SPLs.

Proceedings ArticleDOI
21 Mar 2011
TL;DR: This paper proposes an extension to Model Based Statistical Testing which deals with the mentioned problems and maintains all mentioned advantages and shows that it is possible to generate executable test cases from the Petri nets.
Abstract: Model Based Statistical Testing is a highly automated test approach. It allows the fully automated test case generation, execution, evaluation and estimation of the test objects reliability. This can be done after building a test model which is called a usage model. These models do neither support a notion of time, nor do they allow to model concurrency, which both are of great concern in testing embedded systems. This paper proposes an extension to Model Based Statistical Testing which deals with the mentioned problems and maintains all mentioned advantages of Model Based Statistical Testing. This is done by using an advanced kind of Petri nets as test model. A usage model can be generated out of these Petri nets. The direct creation of a usage model without the use of the proposed Petri nets is not possible in practice if it is necessary to deal with time and concurrency. This is the case because usage models tend to get very large in this very common situation. The paper does also show that it is possible to generate executable test cases (including oracle information) from the Petri nets. Tool support for the presented approach is available.

Proceedings ArticleDOI
13 Oct 2011
TL;DR: This paper proposes an optimization approach aiming at the direct design of the monitors, that allows for an easy formalization of the various control objectives and yields significant improvements over known benchmark problems.
Abstract: Deadlock Prevention and Liveness Enforcement in Petri nets are mostly addressed with monitor-based methods, designed indirectly using the concept of siphon or the theory of regions. The obtained control solutions are sometimes maximally permissive, but generally not optimal in terms of the number of monitors, nor in the cost of the control subnet. This paper proposes an optimization approach aiming at the direct design of the monitors, that allows for an easy formalization of the various control objectives. An efficient solution scheme, based on a branch-and-bound approach is also presented. The proposed monitor design algorithm yields significant improvements over known benchmark problems.

Journal ArticleDOI
TL;DR: This work provides a structural translation of TiMo into behaviourally equivalent high level timed Petri nets and obtains a formal net semantics for timed interaction and migration which is both structural and allows one to deal directly with concurrency and causality.

Book ChapterDOI
01 Jan 2011
TL;DR: A deadlock prevention strategy for flexible manufacturing systems is developed based on Petri nets and their structural analysis, which has at least three advantages: only a smaller number of SMS need to be controlled, hence the deadlock-freeness or live Petri net model obtained has less additional places and arcs.
Abstract: A deadlock prevention strategy for flexible manufacturing systems is developed based on Petri nets and their structural analysis. The concept of elementary siphons is proposed, it is a class of SMS (strict minimal siphons) with a smaller cardinality, particularly in the Petri net models of large-scale systems. By adding a control place for each elementary siphon to make it never be emptied, deadlocks can be prevented for a special class of Petri nets, namely S 3 PR. That means not all SMS need to be considered when ensuring no siphon loses its tokens. For S 3 PR, An approach is proposed for finding elementary siphons and SMS. Compared with the existing methods that control all SMS in a Petri net, the deadlock prevention policy has at least three advantages: 1) only a smaller number of SMS need to be controlled, hence the deadlock-freeness or live Petri net model obtained has less additional places and arcs; 2) not need to compute the set of siphons beforehand; and 3) this policy is more suitable for large-scale Petri nets. These methods are illustrated with an example.

Journal ArticleDOI
TL;DR: This paper creates a general process architecture model based on linear systems theory that allows the stability of equilibrium solutions to be analyzed for distributed design systems by converting any process architecture into an equivalent parallel representation and can accurately predict when the equilibrium is unstable and the system divergent when previous models suggest that the system is convergent.
Abstract: In distributed design processes, individual design subsystems have local control over design variables and seek to satisfy their own individual objectives, which may also be influenced by some system level objectives. The resulting network of coupled subsystems will either converge to a stable equilibrium or diverge in an unstable manner. In this paper, we study the dependence of system stability on the solution process architecture. The solution process architecture describes how the design subsystems are ordered and can be either sequential, parallel, or a hybrid that incorporates both parallel and sequential elements. In this paper, we demonstrate that the stability of a distributed design system does indeed depend on the solution process architecture chosen, and we create a general process architecture model based on linear systems theory. The model allows the stability of equilibrium solutions to be analyzed for distributed design systems by converting any process architecture into an equivalent parallel representation. Moreover, we show that this approach can accurately predict when the equilibrium is unstable and the system divergent when previous models suggest that the system is convergent. [DOI: 10.1115/1.4004463]

Journal ArticleDOI
TL;DR: A Model Driven Development (MDD) model transformation framework allows a software system to be designed in terms of UML Sequence Diagrams and subjected to formal analysis by taking advantage of the strong mathematical framework of Petri Nets.

Journal ArticleDOI
TL;DR: This paper motivates the application of Petri nets for modeling and simulation of biological networks and presents a type of access to relevant metabolic databases such as KEGG, BRENDA, etc that supports semi-automatic generation of the correlated hybrid Petri net model.
Abstract: For the implementation of the virtual cell, the fundamental question is how to model and simulate complex biological networks. During the last 15 years, Petri nets have attracted more and more attention to help to solve this key problem. Regarding the published papers, it seems clear that hybrid functional Petri nets are the adequate method to model complex biological networks. Today, a Petri net model of biological networks is built manually by drawing places, transitions and arcs with mouse events. Therefore, based on relevant molecular database and information systems biological data integration is an essential step in constructing biological networks. In this paper, we will motivate the application of Petri nets for modeling and simulation of biological networks. Furthermore, we will present a type of access to relevant metabolic databases such as KEGG, BRENDA, etc. Based on this integration process, the system supports semi-automatic generation of the correlated hybrid Petri net model. A case study of the cardio-disease related gene-regulated biological network is also presented. MoVisPP is available at http://agbi.techfak.uni-bielefeld.de/movispp/ .

Journal ArticleDOI
01 Apr 2011
TL;DR: This work considers a structured approach for guiding the analyst in creating more insightful models based on a domain-related reference architecture that supports conceptual modeling coupled with uniform rules for mapping high-level concepts onto low-level Petri Net components.
Abstract: Petri Nets have essential strengths in capturing a system's static structure and dynamics, its mathematical underpinning, and providing a graphical representation. However, visual simulation models of realistic systems based on Petri Nets are often perceived as too large and too complex to be easily understood. This constrains stakeholders in participating in such modeling and solution finding, and limits acceptance. We address this issue by considering a structured approach for guiding the analyst in creating more insightful models. Key elements are a domain-related reference architecture that supports conceptual modeling coupled with uniform rules for mapping high-level concepts onto low-level Petri Net components. The proposed approach is implemented and illustrated in the manufacturing domain.

Journal ArticleDOI
TL;DR: The aim of this paper is to provide an algorithmic framework for the challenging task of generating all possible Petri nets fitting the given experimental data.

Book ChapterDOI
06 Sep 2011
TL;DR: This work identifies a subclass of Petri nets, called structural conflict nets, where the interplay between conflict and concurrency due to token multiplicity does not occur and defines abstract processes as equivalence classes of Goltz-Reisig processes.
Abstract: We consider approaches for causal semantics of Petri nets, explicitly representing dependencies between transition occurrences. For one-safe nets or condition/event-systems, the notion of process as defined by Carl Adam Petri provides a notion of a run of a system where causal dependencies are reflected in terms of a partial order. A well-known problem is how to generalise this notion for nets where places may carry several tokens. Goltz and Reisig have defined such a generalisation by distinguishing tokens according to their causal history. However, this so-called individual token interpretation is often considered too detailed. A number of approaches have tackled the problem of defining a more abstract notion of process, thereby obtaining a so-called collective token interpretation. Here we give a short overview on these attempts and then identify a subclass of Petri nets, called structural conflict nets, where the interplay between conflict and concurrency due to token multiplicity does not occur. For this subclass, we define abstract processes as equivalence classes of Goltz-Reisig processes. We justify this approach by showing that we obtain exactly one maximal abstract process if and only if the underlying net is conflict-free with respect to a canonical notion of conflict.

Journal ArticleDOI
TL;DR: This paper provides an overview over the relationship between Petri Nets and Discrete Event Systems as they have been proved as key factors in the cognitive processes of perception and memorization.
Abstract: This paper provides an overview over the relationship between Petri Nets and Discrete Event Systems as they have been proved as key factors in the cognitive processes of perception and memorization. In this sense, different aspects of encoding Petri Nets as Discrete Dynamical Systems that try to advance not only in the problem of reachability but also in the one of describing the periodicity of markings and their similarity, are revised. It is also provided a metric for the case of Non-bounded Petri Nets.

Proceedings Article
16 Jun 2011
TL;DR: An original approach to model checking of Control Interpreted Petri Nets is presented at RTL-level in such a way that model description derived from Petri net is easy to synthesize as reconfigurable logic controller or PLC as well as to formally verify for behavioral properties.
Abstract: The paper presents an original approach to model checking of Control Interpreted Petri Nets. Petri Nets are currently used in the industry, but they are mostly verified only for structural properties. However, behavior properties are also of great importance. They can be verified using model checking technique. Model checking of specification allows to early detect subtle errors resulting from incorrect specification interpretation. Model description derived from Petri net is presented at RTL-level in such a way that it is easy to synthesize as reconfigurable logic controller or PLC as well as to formally verify for behavioral properties.

Book ChapterDOI
14 Nov 2011
TL;DR: There is an opportunity to implement fuzzy logic into web-based education using the created IF-THEN rules and modelling in Petri nets to support a rather simple design of educational activities managed by LMS.
Abstract: Basic requirements, which are imposed on LMS (Learning Management System) from the point of view of the needs of a teacher, are to present the contents of instruction, manage the instruction, communicate with students, motivate them to study, observe their progress and evaluate them. The article deals with an opportunity to implement fuzzy logic into web-based education using the created IF-THEN rules and modelling in Petri nets. By an application of fuzzy logic into Petri nets there arises a strong tool for modelling teaching processes, mainly thanks to the easy understandability and sophisticated mathematical setup, supporting a rather simple design of educational activities managed by LMS, for the compendious modularity of solution and robustness of the design.

Proceedings ArticleDOI
26 Jul 2011
TL;DR: An ontology approach for representing Petri nets with ontologies is proposed, i.e., some key features of Petrinets are translated into classes, properties and axioms of OWL DL ontologies.
Abstract: With the wide utilization of Petri nets, many researchers suggest that Petri nets should be reused and shared. Emerging the Semantic Web technologies, such as ontologies, can play an important role in this scenario. In this paper, we propose an ontology approach for representing Petri nets. Firstly, we propose a complete formal definition of OWL DL ontologies. Then, Petri nets are introduced and a formal definition of Petri nets is given. On this basis, we propose an approach for representing Petri nets with ontologies, i.e., we translate some key features of Petri nets into classes, properties and axioms of OWL DL ontologies.

Proceedings ArticleDOI
20 Jun 2011
TL;DR: An optimised algorithm for computing the parallel composition of labelled Petri nets is proposed, which often produces nets with fewer implicit places, which are thus better suited for subsequent application of structural methods.
Abstract: Parallel composition of labelled Petri nets is a fundamental operation in modular design. It is often used to combine models of subsystems into a model of the whole system. Unfortunately, the standard definition of parallel composition almost always yields a 'messy' Petri net, with many implicit places, causing performance deterioration in tools that are based on structural methods. In this paper we propose an optimised algorithm for computing the parallel composition. It often produces nets with fewer implicit places, which are thus better suited for subsequent application of structural methods.