Free-choice Petri nets-an algebraic approach
暂无分享,去创建一个
[1] T. E. Harris,et al. The Theory of Branching Processes. , 1963 .
[2] Neil D. Jones,et al. Complexity of Some Problems in Petri Nets , 1977, Theor. Comput. Sci..
[3] P. S. Thiagarajan,et al. A Fresh Look at Free Choice Nets , 1984, Inf. Control..
[4] Manuel Silva Suárez,et al. On the analysis and synthesis of free choice systems , 1991, Applications and Theory of Petri Nets.
[5] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.
[6] François Baccelli,et al. Recursive equations and basic properties of timed Petri nets , 1991 .
[7] Joseph T Buck. Scheduling Dynamic Dataflow Graphs with Bounded Memory , 1993 .
[8] Bruno Gaujal. Parallelisme et simulation des systemes a evenements discrets , 1994 .
[9] F. Baccelli,et al. Stationary regime and stability of free-choice Petri nets , 1994 .
[10] François Baccelli,et al. Ergodicity of Jackson-type queueing networks , 1994, Queueing Syst. Theory Appl..
[11] Jörg Desel,et al. Free choice Petri nets , 1995 .
[12] J. Quadrat,et al. Asymptotic throughput of continuous timed Petri nets , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.
[13] F. Baccelli,et al. On the saturation rule for the stability of queues , 1995, Journal of Applied Probability.
[14] François Baccelli,et al. Parallel and distributed simulation of free choice Petri Nets , 1995, PADS.