Recursive equations and basic properties of timed Petri nets
From MaRDI portal
Recommendations
Cited in
(14)- A holistic state equation for timed Petri nets
- Control of Petri nets subject to strict temporal constraints using Max-Plus algebra
- Blocking a transition in a free choice net and what it tells about its throughput.
- Feedback control to guarantee marking constraints in timed event graphs including disturbances: application to disassembly systems
- Invariants of timed Petri nets
- State-feedback control for a class of timed Petri nets subject to marking constraints
- Modelling and feedback control for a class of Petri nets with shared resources subject to strict time constraints using max-plus algebra
- Min-plus realizable control design for partially observable timed event graphs under marking constraints
- A linear characterization of the switching dynamic behavior of timed continuous Petri nets with structural conflicts
- Performance bounds for stochastic timed Petri nets
- Ergodicity of Jackson-type queueing networks
- Solving recursive net equations
- Petri nets for the design and operation of manufacturing systems
- scientific article; zbMATH DE number 4055006 (Why is no real title available?)
This page was built for publication: Recursive equations and basic properties of timed Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198591)