{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T13:47:58Z","timestamp":1740491278211,"version":"3.38.0"},"reference-count":29,"publisher":"Cambridge University Press (CUP)","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Appl. Probab."],"published-print":{"date-parts":[[2013,9]]},"abstract":"<jats:p>We derive factorization identities for a class of preemptive-resume queueing systems, with batch arrivals and catastrophes that, whenever they occur, eliminate multiple customers present in the system. These processes are quite general, as they can be used to approximate L\u00e9vy processes, diffusion processes, and certain types of growth\u2012collapse processes; thus, all of the processes mentioned above also satisfy similar factorization identities. In the L\u00e9vy case, our identities simplify to both the well-known Wiener\u2012Hopf factorization, and another interesting factorization of reflected L\u00e9vy processes starting at an arbitrary initial state. We also show how the ideas can be used to derive transforms for some well-known state-dependent\/inhomogeneous birth\u2012death processes and diffusion processes.<\/jats:p>","DOI":"10.1017\/s002190020000975x","type":"journal-article","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T10:50:46Z","timestamp":1459248646000},"page":"632-653","source":"Crossref","is-referenced-by-count":0,"title":["Factorization Identities for Reflected Processes, with Applications"],"prefix":"10.1017","volume":"50","author":[{"given":"Brian H.","family":"Fralix","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan S. H.","family":"van Leeuwaarden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Onno J.","family":"Boxma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2016,3,1]]},"reference":[{"key":"S002190020000975X_ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1114054"},{"key":"S002190020000975X_ref3","doi-asserted-by":"publisher","DOI":"10.2307\/1427274"},{"key":"S002190020000975X_ref19","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1276784903"},{"key":"S002190020000975X_ref17","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1013540243"},{"key":"S002190020000975X_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-011-9257-7"},{"key":"S002190020000975X_ref15","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728918"},{"key":"S002190020000975X_ref32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.6.755"},{"key":"S002190020000975X_ref9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1017\/S0001867800003189","volume":"41","year":"2009","journal-title":"Adv. Appl. Prob."},{"volume":"II","journal-title":"An Introduction to the Theory of Point Processes","year":"2008","key":"S002190020000975X_ref14"},{"key":"S002190020000975X_ref8","first-page":"288","volume":"16","year":"1954","journal-title":"Proc. R. Statist. Soc. B"},{"volume":"I","journal-title":"An Introduction to the Theory of Point Processes","year":"2003","key":"S002190020000975X_ref13"},{"volume-title":"Elements of Queueing Theory","year":"2003","key":"S002190020000975X_ref7"},{"volume-title":"Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues","year":"1999","key":"S002190020000975X_ref12"},{"volume-title":"Applied Probability and Queues","year":"2003","key":"S002190020000975X_ref6"},{"volume-title":"Point Processes and Queues","year":"1981","key":"S002190020000975X_ref11"},{"key":"S002190020000975X_ref5","doi-asserted-by":"publisher","DOI":"10.1080\/15326349808807494"},{"key":"S002190020000975X_ref10","doi-asserted-by":"publisher","DOI":"10.2307\/1426397"},{"key":"S002190020000975X_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01182933"},{"key":"S002190020000975X_ref1","doi-asserted-by":"publisher","DOI":"10.2307\/1427409"},{"key":"S002190020000975X_ref29","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176995581"},{"key":"S002190020000975X_ref28","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024718709227"},{"key":"S002190020000975X_ref27","first-page":"432","volume":"55","year":"2010","journal-title":"Theory Prob. Appl."},{"key":"S002190020000975X_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2013.06.008"},{"volume-title":"Random Measures","year":"1983","key":"S002190020000975X_ref25"},{"key":"S002190020000975X_ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1113053"},{"key":"S002190020000975X_ref23","doi-asserted-by":"publisher","DOI":"10.2307\/1426747"},{"key":"S002190020000975X_ref22","first-page":"208","volume":"4","year":"2004","journal-title":"Manufact. Service Operat. Manag."},{"key":"S002190020000975X_ref4","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.7.1.36"},{"key":"S002190020000975X_ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.spa.2011.03.010"}],"container-title":["Journal of Applied Probability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S002190020000975X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T05:29:07Z","timestamp":1498282147000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S002190020000975X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":29,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["S002190020000975X"],"URL":"https:\/\/doi.org\/10.1017\/s002190020000975x","relation":{},"ISSN":["0021-9002","1475-6072"],"issn-type":[{"type":"print","value":"0021-9002"},{"type":"electronic","value":"1475-6072"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}