Recursive equations and basic properties of timed Petri nets
From MaRDI portal
Publication:1198591
zbMath0753.60084MaRDI QIDQ1198591
Guy Cohen, Bruno Gaujal, François Baccelli
Publication date: 16 January 1993
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Petri netsqueueing networksnonlinear extension of the recursive equations for conflict free timed Petri netsstochastic monotonicity properties
Markov renewal processes, semi-Markov processes (60K15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (9)
Ergodicity of Jackson-type queueing networks ⋮ Petri nets for the design and operation of manufacturing systems ⋮ Performance bounds for stochastic timed Petri nets ⋮ 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 ⋮ Min-plus realizable control design for partially observable timed event graphs under marking constraints ⋮ State‐Feedback Control for a Class of Timed Petri Nets Subject to Marking Constraints ⋮ Control of Petri nets subject to strict temporal constraints using Max-Plus algebra ⋮ Modelling and feedback control for a class of Petri Nets with shared resources subject to strict time constraints using Max-plus algebra
This page was built for publication: Recursive equations and basic properties of timed Petri nets
