Continuous Petri Nets (CPN) can be used to approximate classical discrete Petri nets which suffer from the state explosion problem. In this paper we focus on the control of timed CPN (TCPN), aiming to drive the system from an initial state to a desired final one. This problem is similar to the set-point control problem in a general continuous-state system. In a previous work, a simple and effic...

Despite the recent rapid progress in high throughput measurements of biological data, it is still difficult to gather all of the reaction speed data in biological pathways. This paper presents a Petri net-based algorithm that can derive estimated values for non-valid reaction speeds in a signaling pathway from biologically-valid data. In fact, these reaction speeds are reflected based on the de...

In this paper, we present the features of Romeo, a Time Petri Net (TPN) analyzer. The tool Romeo allows state space computation of TPN and on-the-fly model-checking of reachability properties. It performs translations from TPNs to Timed Automata (TAs) that preserve the behavioural semantics (timed bisimilarity) of the TPNs. Besides, our tool also deals with an extension of Time Petri Nets (Sche...

This paper presents a Timed Coloured Petri Nets based programming tool that supports modeling and performance analysis of distributed World Wide Web environments. A distributed Internet system model, initially described in compliance with Queueing Theory (QT) rules, is mapped onto the Timed Coloured Petri Net (TCPN) structure by means of queueing system templates. Then, it is executed and analy...

Petri-Net is widely used in the field of modeling a flexible manufacturing system (FMS) because of its intrinsic features such as concurrency, uynchronization, conflict, and eventtriggering. But designing a Petri-Net Model for an FMS is extremely tedious and difficult for debugging. Therefore, an automatic Petri-Net generator which can generate a bug-free model for an FMS is rather useful and p...

Reliability analysis is often based on stochastic discrete event models like Markov models or stochastic Petri nets. For complex dynamical systems with numerous components, analytical expressions of the steady state are tedious to work out because of the combinatory explosion with discrete models. Moreover, the convergence of stochastic estimators is slow. For these reasons, fluidification can ...

A method for systematic generation of simple and composite schedules for a large class of manufacturing cells is presented. The generated schedules can easily be transformed into timed Petri net models, and these models evaluated using one of methods developed for analysis of timed Petri nets, for example, invariant analysis. Performance characterization (the cycle time or the throughput) obtai...

Retention-free Petri net has been used in modeling of signaling pathways, which is a timed Petri net such that total input and total output token flows are equivalent at any place. Previously we have investigated the dependency of transitions in retention-free Petri net. In this paper, we introduce a modeling method for signaling pathway by using Petri net, giving properties of retention-freene...

In this paper we tackle the decidability of marking reachability for a hybrid formalism based on Petri nets. The model we consider is the untimed version of First–Order Hybrid Petri Nets: it combines a discrete Petri net and a continuous Petri net, the latter being a fluid version of a usual discrete Petri net. It is suggested that the decidability results should be pursued exploiting a hierarc...

Petri net unfolding prefixes are an important technique for formal verification and synthesis. In this paper we show that the requirement that the adequate order used for truncating a Petri net unfolding must be well-founded is superfluous in many important cases, i.e. it logically follows from other requirements. We give a complete analysis when this is the case. These results concern the very...