In the continuing research towards characterizing 1-safe Petri nets with n-places and generating all the 2n binary n-vectors as marking vectors exactly once, the problem of determine minimum Petri nets; 'minimum' in the sense that the number of transitions is kept minimum possible for the generation of all the 2n binary n-vectors has been found. In this paper, the existence and unique...

High availability constraints ensure a high level of operational performance that must be maintained during a contractual measurement period. Such constraints must be satisfied, particularly, for critical systems related to global security and human safety. High availability often results from material redundancies and lead to large stochastic discrete event models with numerous states. Markov ...

We propose MPath2PN, a tool which automatically translates metabolic pathways, as described in the major biological databases, into corresponding Petri net representations. The aim is to allow for a systematic reuse, in the setting of metabolic pathways, of the variety of tools existing for Petri net analysis and simulation. The current prototype implementation of MPath2PN inputs the KEGG descr...

Petri net schemata are an intuitive and expressive approach to describe high-level Petri nets. A Petri net schema is a Petri net with edges and transitions inscribed by terms and Boolean expressions, respectively. A concrete high-level net is gained by interpreting the symbols in the inscriptions by a structure. Its semantics can then be described in terms of a transition system. Therefore, the...

This paper approaches the process of validating and verifying the embedded control system of a satellite prototype. The focus of this approach is on the integration of UML and Petri nets, aiming at the formal verification of the system requirements. The approach is composed of: (1) simulation of the UML model in a CASE tool; (2) simulation of the Petri net model in a Petri net simulator; and (3...

In this paper, we revisit the conjecture of [1], stating that ε-free Petri nets with transfer arcs are strictly more expressive than ε-free Petri nets with reset arcs. In [1], an ε-free Petri net with transfer arcs is provided, whose language is conjectured not to be recognizable by any ε-free Petri net with reset arcs. We show that this latter conjecture is flawed, by exhibiting an ε-free Petr...

High-level Petri nets (evolutions of low-level Petri nets) are well suitable formalisms to represent complex data, which influence the behavior of distributed, concurrent systems. However, usual verification techniques such as model checking and testing remain an open challenge for both (i.e., low-level and high-level Petri nets) because of the state space explosion problem and test case select...

Object based Petri nets are becoming increasingly popular in many fields of computer science. The possibility to model real-world objects as separate Petri nets supports the need for modular design of complex systems. So far object net approaches have been based on the presumption that the object nets’ structure remains unchanged in all processes. This paper sheds some light on possible extensi...

Petri nets are excellent networks which have great characteristics of combining a welldefined mathematical theory with a graphical representation of the dynamic behavior of systems. The theoretical aspect of Petri nets allows precise modeling and analysis of system behavior, at the same time, the graphical representation of Petri nets enable visualization of state changes of the modeled system ...

Biometric Identification Protocol with Random Parameter is modelled in the current paper by using Petri Nets, namely with the modern extension of Petri Nets-Colored Petri Nets. The purpose of modelling Biometric Identification Protocol with Random Parameter by the use of Petri Nets is to reveal the following aspects of the functioning model: The efficiency of the model; Behaviour; The existence...