This paper presents an original performance analysis applied to a flow-shop system driven by a set of local command units and a central controller. The performance evaluation is done with a timed coloured Petri net model. Simulation results show needs for bounding the controller response time in order to meet production targets.

It is shown that a large class of flexible manufacturing cells can be modeled by timed Petri nets. Several net transformations are proposed to simplify the structure of the modeling nets while preserving their performance properties. The throughput of the model can be obtained by applying simple rules of operational analysis to simplified nets. Several extensions of the proposed approach are al...

In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We consider bounded TPN, whose underlying net is not necessarily bounded. We prove that our translation preserves the behavioural semantics of the TPN (the initial TPN and the obtained TA are proved timed-bisimilar). It...

We propose to use high-level Petri nets as a model for the semantics of high-level parallel systems. This model is known to be useful for the purpose of verification and we show that it is also executable in a parallel way. Executing a Petri net is not difficult in general but more complicated in a timed context, which makes necessary to synchronise the internal time of the Petri net with the r...

In this Chapter we address the problem of controller synthesis for timed systems. By timed systems we refer to systems which are subject to quantitative (hard) real-time constraints. We assume the reader is familiar with the basics of Timed Automata theory, or has read Chapter 1 and Chapter 2 in this book. It is not always possible to use discrete time to specify and model timing constraints. T...

Timing aspects in formalisms with explicit resources and parallelism are investigated, and it is presented a formal link between timed membrane systems and timed Petri nets with localities. For both formalisms, timing does not increase the expressive power; however both timed membrane systems and timed Petri nets are more flexible in describing molecular phenomena where time is a critical resou...

due to the changes which may occur in their parameters, systems are usually demonstrated by some subsystems for different conditions. this paper employs modified petri nets (mpn) to model theses subsystems and makes it simple to analyze them. in this method, first, the continuous transfer function is converted to a discrete transfer function and then, by mpn, system is modeled and analyzed. all...

The paper deals with the problem of timed state space generation and exploration in the frame of simulation–optimization pproach for discrete-event systems. Coloured Petri net representation of a system is considered and corresponding techniques f timed state space generation and timed simulation are addressed. It is shown that the established simulation techniques do not erform adequately in s...

This paper presents a technique to estimate the average time separation of events (TSE) in stochastic timed Petri nets that can model time-independent choice and have arbitrary delay distributions associated with places. The approach analyzes nite net unfoldings to derive closed-form expressions for lower and upper bounds on the average TSE, which can be eeciently evaluated using standard stati...