{"version":"1.0","provider_name":"","provider_url":"https:\/\/www.deberes.net\/tesis","author_name":"deberes","author_url":"https:\/\/www.deberes.net\/tesis\/author\/infouniversidad\/","title":"Performance bounds for synchronized queueing networks","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"1Bggk9yqWR\"><a href=\"https:\/\/www.deberes.net\/tesis\/matematicas\/performance-bounds-for-synchronized-queueing-networks\/\">Performance bounds for synchronized queueing networks<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/www.deberes.net\/tesis\/matematicas\/performance-bounds-for-synchronized-queueing-networks\/embed\/#?secret=1Bggk9yqWR\" width=\"600\" height=\"338\" title=\"\u00abPerformance bounds for synchronized queueing networks\u00bb \u2014 \" data-secret=\"1Bggk9yqWR\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script>\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n<\/script>\n","description":"Performance bounds for synchronized queueing networks tesis doctoral de Javier Campos Laclaustra. Tesis doctoral de Javier Campos Laclaustra Las redes de petri estocasticas constituyen un modelo unificado de las diferentes extensiones de redes de colas. Tesis sobre Colas, Investigacion operativa, Matem\u00e1ticas, Zaragoza"}