On Reachability in Autonomous Continuous Petri Net Systems

An Efficient Heuristics for Minimum Time Control of Continuous Petri nets

“…I are positive and reachable (Júlvez et al (2003)). We will describe how to compute intermediate states that lie on the borders and the interior of regions, separately.…”

“…We assume that m 0 and m f are interior points of the reachability space, i.e., the markings are strictly positive. The assumption that m 0 is positive ensures that the system can move at τ = 0 in the direction of m f ; the assumption that m f is positive ensures that m f can be reached (Júlvez et al (2003)) in finite time (Mahulea et al (2008b)). …”

Modelling Systems by Hybrid Petri Nets: an Application to Supply Chains

“…An interesting comparison on two different techniques to compute the steady-state of continuous nets was made in (Demongodin & Giua, 2002): a method based on linear programming and a method based on graph theory are considered. Other interesting papers have been devoted to the problem of production frequencies estimation for systems that are modeled by CPNs (Lefebvre, 2000), to the design of observers , to the reachability analysis (Júlvez et al, 2003), to the stability analysis (Amer-Yahia & Zerhouni, 2001), and to the deadlock-freeness analysis (Júlvez et al, 2002). The problem of deriving an optimal control law for CPNs under the assumption of finite servers semantics has been studied in (Bemporad et al, 2004).…”

A state estimation problem for timed continuous Petri nets

“…Anyhow, in [10] an algorithm to compute it is provided. For some subclasses, there exists a more simple characterization:…”