An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions-Reference-Cited by-同舟云学术

An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions

Published:2009-02 Issue:3-4 Volume:49 Page:563-572
ISSN:0895-7177
Container-title:Mathematical and Computer Modelling
language:en
Short-container-title:Mathematical and Computer Modelling

Author:

Janssens Gerrit K.,Sörensen Kenneth,Dullaert Wout

Publisher

Elsevier BV

Subject

Computer Science Applications,Modelling and Simulation

Reference19 articles.

1. Synchronization and Linearity: An Algebra for Discrete Event Systems;Baccelli,1992

2. Insurance calculations using incomplete information;Brockett;Scandinavian Actuarial Journal,1985

3. P. Buchholz, P. Kemper, Numerical analysis of stochastic marked graph nets, in: Proceedings of the 6th International Workshop on Petri Nets and Performance Models, Durham, USA, 1995, pp. 32–41

4. Properties and performance bounds for timed marked graphs;Campos;IEEE Transactions on Circuits and Systems I,1992

5. C.I. Ciufudean, C.I. Petrescu, A.G. Graur, Availability of fluid stochastic event graphs, in: International Conference on Control and Automation, ICCA05, vol. 1, Budapest, Hungary, 2005, pp. 255–258

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asymmetric cycle time bounding in semiconductor manufacturing: an efficient and effective back-propagation-network-based method;Operational Research;2015-10-12

2. A new cloud computing method for establishing asymmetric cycle time intervals in a wafer fabrication factory;Journal of Intelligent Manufacturing;2015-02-14