This paper addresses the computation of upper bounds for the steady-state throughput of stochastic Petri net systems with immediate and generally distributed timed transitions. It is achieved through the use of a kind of decomposition of the whole net system. Results are obtained deeply bridging stochastic Petri net theory to untimed Petri net and queueing network theories. Previous results are...

When writing can change your life, when writing can enrich you by offering much money, why don't you try it? Are you still very confused of where getting the ideas? Do you still have no idea with what you are going to write? Now, you will need reading. A good writer is a good reader at once. You can define how you write depending on what books to read. This advances in verification of time petr...

This paper presents the modeling and simulation of a manufacturing system using Petri nets. A manufacturing system consists of robots, computer-controlled machines, numerical controlled machines, computers and automated guided vehicle. Timed Petri nets are used to model, simulate and evaluate the manufacturing system. The Petri net model is implemented in Petri Net Toolbox under MATLAB environm...

This paper presents a real life Petri Net-based prototype for project management in the Animation and Videogame (A&V) industry in Colombia. Such a Petri Net prototype is a module embedded in a larger computer application aimed for integrated and collaborative management of A&V projects. This project management application also includes modules for modeling, resource planning, scheduling and exe...

We investigate expressiveness questions for time Petri nets (TPNs) and some their most usefull extensions. We first introduce generalised time Petri nets (GTPNs) as an abstract model that encompasses variants of TPNs such as self modifications and read, reset and inhibitor arcs. We give a syntactical translation from bounded GTPNs to timed automata (TA) that generates isomorphic transition syst...

We give a method to compute the throughput in a timed live and bounded free-choice Petri net under a total allocation (i.e. a 0-1 routing). We also characterize and compute the conflict-solving policies that achieve the smallest throughput in the special case of a 1-bounded net. They do not correspond to total allocations, but still have a small period.

In this paper, an optimal group control for elevator systems is proposed with timed Petri net based approach. Elevator system is modeled by timed Petri nets and hall call response times are estimated with moment generating functions (MGFs) method, which is applicable to real traffic patterns. Two assignment policies are proposed to satisfy the demands of passengers (i.e. hall/car calls) and to ...