Unbounded product-form Petri nets
From MaRDI portal
Publication:5111645
Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- scientific article; zbMATH DE number 4024806 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- scientific article; zbMATH DE number 3582425 (Why is no real title available?)
- scientific article; zbMATH DE number 559221 (Why is no real title available?)
- scientific article; zbMATH DE number 1755143 (Why is no real title available?)
- scientific article; zbMATH DE number 763717 (Why is no real title available?)
- Closed Queuing Systems with Exponential Servers
- Deficiency Zero Petri Nets and Product Form
- Eager Markov Chains
- Mean value analysis of stochastic Petri nets
- Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets
- Synthesis and analysis of product-form Petri nets
- The covering and boundedness problems for vector addition systems
Cited in
(5)
This page was built for publication: Unbounded product-form Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111645)