The place invariant method is well known as an elegant way to construct a Petri net controller. It is possible to use the constraint for preventing forbidden states. But in general case, the number forbidden states can be very large giving a great number of control places. In this paper is presented a systematic method to reduce the size and the number of constraints. This method is applicable ...

We define an extension of time Petri nets such that the time at which a transition can fire, also called its firing date, may be dynamically updated. Our extension provides two mechanisms for updating the timing constraints of a net. First, we propose to change the static time interval of a transition each time it is newly enabled; in this case the new time interval is given as a function of th...

This article presents several diierent kinds of Petri nets, together with computer tools based on them, and compares possibilities of their application in the area of simulation and modelling. Place/transition Petri nets, stochastic Petri nets, hierarchical coloured Petri nets and nally object oriented Petri nets are mentioned here. As for the tools, Design/CPN, TimeNET, LOOPN++ and PNtalk are ...

Algebraic Petri nets is a well suited formalism to represent the behavior of concurrent and distributed systems by handling complex data. For the analysis of systems modelled in Algebraic Petri nets, model checking and testing are used commonly. Petri nets slicing is getting an attention recently to improve the analysis of systems modelled in Petri nets or Algebraic Petri nets. This work is ori...

in this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition petri nets. the mobile agent system contains two mobile agents called dca and una. it sends out agents to update antivirus on client computers in a network. each agent takes on a specified responsibility. first, dca roams through the network and check the last d...

This paper introduces a new method of empowering Logical Petri Nets (LPN) and Fuzzy Logical Petri Nets (FLPN) [1] using multiple logic. In this paper we proposed a Multi-Logical Petri Nets (MLPN) and Multi-Logical Fuzzy Petri Nets (MLFPN) based on Logical Petri Nets (LPN) and Fuzzy Logical Petri Nets (FLPN). Here we have showed that, how multiple logic is implemented in MLPN and MLFPN. The prop...

The design of real-time systems needs a high-level specification model supporting at the same time timing constraints and actions duration. The authors introduce in this paper an extension of Petri Nets called Time Petri Nets with Action Duration (DTPN) where time is associated with transitions. In DTPN, the firing of transitions is bound to a time interval and transitions represent actions whi...

We present here a way to compute the minimal semi-positive invariants of a Petri net representing a biological reaction system, as resolution of a CSP. The use of Petri-nets to manipulate those models and make available a variety of tools is quite old, and recently analyses based on invariant computation for biological models have become more and more frequent, especially in the context of modu...

Time and Petri nets-do they not contradict each other? While time determines the occurrences of events in a system, classic Petri nets consider their causal relationships and represent events as a concurrent system. At first, these two appear to be at odds with each other, but taking a closer look at how time and causality are intertwined, one realizes that time actually enriches Petri nets. Th...