On the computation of structural synchronic invariants in P/T nets
Advances in Petri Nets 1988
Discrete-Event Simulation of Fluid Stochastic Petri Nets
IEEE Transactions on Software Engineering
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
FSPNs: Fluid Stochastic Petri Nets
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Petri nets and integrality relaxations: A view of continuous Petri net models
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
On Controllability of Timed Continuous Petri Nets
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Continuous Petri nets: expressive power and decidability issues
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
On fluidization of discrete event models: observation and control of continuous Petri nets
Discrete Event Dynamic Systems
Optimal stationary behavior for a class of timed continuous Petri nets
Automatica (Journal of IFAC)
Complexity analysis of continuous Petri nets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Hi-index | 0.00 |
Fluidification is a common relaxation technique used to deal in a more friendly way with large discrete event dynamic systems. In Petri nets, fluidification leads to continuous Petri nets systems in which the firing amounts are not restricted to be integers. For these systems reachability can be interpreted in several ways. The concepts of reachability and lim-reachability were considered in [7]. They stand for those markings that can be reached with a finite and an infinite firing sequence respectively. This paper introduces a third concept, the δ-reachability. A marking is δ-reachable if the system can get arbitrarily close to it with a finite firing sequence. A full characterization, mainly based on the state equation, is provided for all three concepts for general nets. Under the condition that every transition is fireable at least once, it holds that the state equation does not have spurious solutions if δ-reachability is considered. Furthermore, the differences among the three concepts are in the border points of the spaces they define. For mutual lim-reachability and δ-reachability among markings, i.e., reversibility, a necessary and sufficient condition is provided in terms of liveness.