We consider an extension of Timed Petri Nets “à la Ramchandani” where the transitions are partitioned into delayable and non-delayable which has proven to be suitable for design synchronous circuits. For this model called Delayable Net (DTPN), firing delay a transition is strict whereas can miss its delay. Since delays natural numbers, studied as discrete time model.We deal with expressiveness ...

Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the described mutual translations are rather inefficient. We propose an extension of timed-arc Petri nets with invariants to enforce urgency and with transport arcs to generalise the read-arcs. We also describe a novel translat...

Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of TPNs concerns their translation to TAs, at which point efficient analysis tools for TAs can then be applied. One feature of much of this previous work has been the use of timed reachability analysis on the TPN in order to cons...

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

Current technology trends have led to the growing impact of process variations on performance of asynchronous circuits. As it is imperative to model process parameter variations for sub-100nm technologies to produce a more real performance metric, it is equally important to consider the correlation of these variations to increase the accuracy of the performance computation. In this paper, we pr...

Timed Petri Nets (also called Duration Petri Nets, DPNs) [7, 8] are a commonly used class for modeling formally complex technical systems as embedded real time systems, for instance in aeronautics. Engineers stated that intervals allowing some variable duration of events would be a more realistic view, so Interval-Timed Petri Nets (ITPNs) have been proposed as generalizations in [2]. Hierarchic...

This paper introduces a new real-time concept of reconfigurable P-timed Petri nets. Our goal is to provide a formal model to build and modify a net on the fly. In the first part of the article, the original P-timed extensions are summarized. Then we define an endomorphism that alters the original Petri net in real time; for instance one can change the number of tokens or the net structure. The ...

The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove...

Petri nets are suitable for modelling of discrete-event systems with highly parallel and cooperating activities. In complex man-made systems, such as manufacturing systems, the systems’ specific properties, such as conflicts, deadlocks, limited buffer sizes, and finite resource constraints can be easily represented in the Petri net model. Therefore teaching of Petri net basics is an inevitable ...