Petri, C. A. , Kommunikation mit automaten, Schriften des Institutes fur Instrumentelle Mathematik, Bonn, 1962. Callou, G. , Macial, P. , Tutsch, D. , Araujo, J. , Ferreira, J. and Souza, R. , A Petri net-based approach to the quantification of data center dependability. In: Petri nets—Manufacturing and Computer Science (Ed. : Pawel Pawlewski), 2012, 313-336. Dassow, J. , Mavlankulov, G. , Othm...

This paper presents the EXHOST-PIPE software: an extension of PIPE – Platform Independent Petri net Editor – that complies with our own specifications. The new version supports the two kinds of Petri nets we have developed: particle Petri nets and plan Petri nets. EXHOST-PIPE also supports colours, modularity, time, guards, differential equations. . . The Petri net player has been extended and ...

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

This paper extends the power hierarchy of dependability models developed by Malhotra and Trivedi (1994) and Muppala et al. (2000) to include Piecewise Deterministic Markov Processes (PDP) and PDP-related Petri Nets. PDPs are known as the largest class of continuous-time hybrid state Markov processes not involving diffusions. Since Petri Nets have proven to be extremely useful in developing Mark...

The article studies the interrelation of Languages of Colored Petri Nets and Traditional formal languages. The author constructed the graph of Colored Petri Net, which generates L Context-free language. This language may not be modeled using standard Petri Nets [1]. The Venn graph and diagram that the author modified [1], show the interrelation between languages of Colored Petri Nets and some T...

The unfolding of (1-)safe Petri nets to occurrence nets is well understood. There is a universal characterization of the unfolding of a safe net which is part and parcel of a coreflection from the category of occurrence nets to the category of safe nets. The unfolding of general Petri nets, nets with multiplicities on arcs whose markings are multisets of places, does not possess a directly anal...

Adding real time information to Petri net models often leads to undecidability of classical verification problems such as reachability and boundedness. For instance, models such as Timed-Transition Petri nets (TPNs) [22] are intractable except in a bounded setting. On the other hand, the model of TimedArc Petri nets [26] enjoys decidability results for boundedness and control-state reachability...

It had been shown that Merlin’s Time Petri Nets are a special case of Time Stream Petri Nets. In this paper, we show that it does not exist a time equivalence between both models. We extend first this result to the non equivalence of Timed Automata and Time Petri Nets and second to the non equivalence of Timed Link Petri Net and Timed Transition Petri Net.

Continuous Petri nets are a relaxation of classical discrete Petri nets in which transitions can be fired a fractional number of times, and consequently places may contain a fractional number of tokens. Such continuous Petri nets are an appealing object to study since they over approximate the set of reachable configurations of their discrete counterparts, and their reachability problem is know...