We motivate and study the synthesis of Petri nets. Petri net synthesis can avoid the state exploration problem by guaranteeing the correctness in the Petri net while incrementally expanding the net. For systems specified in Petri nets, this paper proposes a synthesis method. One major advantage of this synthesis technique is that the resultant ordinary Petri net is guaranteed to be structural l...

Petri Nets are tools for the analysis and design of concurrent systems. There is a formal theory, which supports Petri Nets. We propose Petri Nets with Clocks which has a high expressive power in the concurrent and asynchronous process modeling and gives the possibility to model real time systems. The Petri Nets with Clocks are useful to model systems with temporal requirements via specificatio...

Within MDA models are usually created in the UML. However, one may prefer to use different notations such as Petri-nets, for example, for modelling concurrency and synchronization properties of systems. This paper claims that techniques that are adopted within the context of MDA can also be beneficial in modelling systems by using notations other than the UML. Petri-Nets are widely used for mod...

Petri nets are a useful tool for the modeling and performance evaluation of discrete event systems. Literature reveals that the Petri Net models of real-world discrete event systems are most frequently event graphs (a subclass of Petri nets). Literature also reveals that there are some simple methods for the performance evaluation of event graphs. The general-purpose Petri Net simulator (GPenSI...

When designing complex systems, mechanisms for structuring, composing, and reusing system components are crucial. Today, there are many approaches for equipping Petri nets with such mechanisms. In the context of defining a standard interchange format for Petri nets, modular PNML was defined as a mechanism for modules in Petri nets that is independent from a particular version of Petri nets and ...

Network penetration testing is a well-known approach used for security testing. Penetrating testing can be a laborious task which relies much on human knowledge and expertise, with various techniques employed, and an extensive amount of tools used in the process. A methodical approach to penetration testing is therefore recommended. The flaw hypothesis methodology, used in this thesis, represen...

In the domain of concurrent object-oriented programming (COOP) there is a strong need for a formalism to describe concurrency. Such a formalism is ooered by Petri nets, which however lack thorough modularisation techniques for coping with models for large systems. An appropriate combination of COOP and Petri nets is required in order to proot from the strength of both methods. This paper gives ...

A Petri net is an abstract formal model of the behavior of a system and information flow. The properties, concepts, and techniques of Petri net are so as to present it as a simple and strong method for describing and analyzing information flow and systems control. Fuzzy Petri Net (FPN) is an appropriate powerful model to emulate knowledge base systems using fuzzy rules. Yet, FPN model does not ...

In this paper, we present a new formalismfor modelling concurrent systems, called Petri charts, which is based on Petri nets and statechart principles. It aims at beneeting from the power of both methods in order to provide a modelling method that has substantial expressive power and abstraction function-alities, which are necessary for introducing a formal method into the eld of modelling real...

We prove the following property for safe marked graphs, safe conflict-free Petri nets, and live and safe extended free-choice Petri nets. We prove the following three results. If the Petri net is a marked graph, then the length of the shortest path is at most (|T |−1)·|T |/2. If the Petri net is conflict free, then the length of the shortest path is at most (|T |+1)·|T |/2. If the Petri net is ...