A polynomial algorithm was given by the authors and Bernar-dinello for synthesizing pure weighted Petri nets from nite labeled transition systems. The limitation to pure nets, serious in practice e.g. for modelling waiting loops in communication protocols, may be removed by a minor adaptation of the algorithm, working for general Petri nets red sequentially. The rule of sequential ring reduces ...

Analytical modeling is a crucial part in the analysis and design of computer systems. Stochastic Petri Nets represent a powerful tool, widely used for dependability, performance and performability modeling. Many structural and stochastic extensions have been proposed so as to increase their modeling power. In this paper we review the main structural and stochastic extensions of Petri nets, by p...

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...

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 ...

Preface It is already a tradition to select papers from the annual PETRI NETS conference for a special issue of Fundamenta Informaticae. This volume presents six papers that extend or combine seven papers from the 34th International Conference on Application and Theory of Petri Nets and Concurrency which took place at the Università degli Studi di Milano-Bicocca in June 2013. The program commit...

Petri nets were introduced in 1962 by Dr. Carl Adam Petri (Petri 1962). Petri nets are a powerful modeling formalism in computer science, system engineering and many other disciplines. Petri nets combine a well defined mathematical theory with a graphical representation of the dynamic behavior of systems. The theoretic aspect of Petri nets allow precise modeling and analysis of system behavior,...

We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as conflict-free, BPP, normal Petri nets and more. A new decomposition approach is applied to developing an integer linear programming formulation for characterizing the reachability sets of such Petri nets. Consequentl...

The increasing number of Petri net variants naturally leads to the question whether the term “Petri net” is more than a common name for very different concepts. This contribution tries to identify aspects common to all or at least to most Petri nets. It concentrates on those features where Petri nets significantly differ from other modeling languages, i.e. we ask where the use of Petri nets lea...

Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling an...