{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:31Z","timestamp":1740099511718,"version":"3.37.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030308056"},{"type":"electronic","value":"9783030308063"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30806-3_12","type":"book-chapter","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:08:36Z","timestamp":1567760916000},"page":"149-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reachability Problems on Partially Lossy Queue Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4575-9339","authenticated-orcid":false,"given":"Chris","family":"K\u00f6cher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,6]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"PA Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91\u2013101 (1996). \n                    https:\/\/doi.org\/10.1006\/inco.1996.0053","journal-title":"Inf. Comput."},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/B:FORM.0000033962.51898.1a","volume":"25","author":"PA Abdulla","year":"2004","unstructured":"Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Formal Methods Syst. Des. 25(1), 39\u201365 (2004). \n                    https:\/\/doi.org\/10.1023\/B:FORM.0000033962.51898.1a","journal-title":"Formal Methods Syst. Des."},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1008719024240","volume":"14","author":"B Boigelot","year":"1999","unstructured":"Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using QDDs. Formal Methods Syst. Des. 14(3), 237\u2013255 (1999). \n                    https:\/\/doi.org\/10.1023\/A:1008719024240","journal-title":"Formal Methods Syst. Des."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0032741","volume-title":"Static Analysis","author":"B Boigelot","year":"1997","unstructured":"Boigelot, B., Godefroid, P., Willems, B., Wolper, P.: The power of QDDs (extended abstract). In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol. 1302, pp. 172\u2013186. Springer, Heidelberg (1997). \n                    https:\/\/doi.org\/10.1007\/BFb0032741"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR \u201997: Concurrency Theory","author":"A Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135\u2013150. Springer, Heidelberg (1997). \n                    https:\/\/doi.org\/10.1007\/3-540-63141-0_10"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323\u2013342 (1983). \n                    https:\/\/doi.org\/10.1145\/322374.322380","journal-title":"J. ACM"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: LICS 2008, pp. 205\u2013216. IEEE Computer Society Press (2008). \n                    https:\/\/doi.org\/10.1109\/LICS.2008.47","DOI":"10.1109\/LICS.2008.47"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2000","unstructured":"Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 232\u2013247. Springer, Heidelberg (2000). \n                    https:\/\/doi.org\/10.1007\/10722167_20"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S1571-0661(05)80426-8","volume":"9","author":"A Finkel","year":"1997","unstructured":"Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. Electron. Notes Theor. Comput. Sci. 9, 27\u201337 (1997). \n                    https:\/\/doi.org\/10.1016\/S1571-0661(05)80426-8","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/S0021-9800(69)80111-0","volume":"6","author":"LH Haines","year":"1969","unstructured":"Haines, L.H.: On free monoids partially ordered by embedding. J. Comb. Theory 6(1), 94\u201398 (1969). \n                    https:\/\/doi.org\/10.1016\/S0021-9800(69)80111-0","journal-title":"J. Comb. Theory"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00233-016-9835-4","volume":"95","author":"M Huschenbett","year":"2017","unstructured":"Huschenbett, M., Kuske, D., Zetzsche, G.: The monoid of queue actions. Semigroup Forum 95(3), 475\u2013508 (2017). \n                    https:\/\/doi.org\/10.1007\/s00233-016-9835-4","journal-title":"Semigroup Forum"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"K\u00f6cher, C.: Rational, recognizable, and aperiodic sets in the partially lossy queue monoid. In: STACS 2018. LIPIcs, vol. 96, pp. 45:1\u201345:14. Dagstuhl Publishing (2018). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2018.45","DOI":"10.4230\/LIPIcs.STACS.2018.45"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1051\/ita\/2018003","volume":"52","author":"C K\u00f6cher","year":"2018","unstructured":"K\u00f6cher, C., Kuske, D., Prianychnykova, O.: The inclusion structure of partially lossy queue monoids and their trace submonoids. RAIRO - Theor. Inf. Appl. 52(1), 55\u201386 (2018). \n                    https:\/\/doi.org\/10.1051\/ita\/2018003","journal-title":"RAIRO - Theor. Inf. Appl."},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00646-1","volume":"297","author":"R Mayr","year":"2003","unstructured":"Mayr, R.: Undecidable problems in unreliable computations. Theoret. Comput. Sci. 297(1), 337\u2013354 (2003). \n                    https:\/\/doi.org\/10.1016\/S0304-3975(02)00646-1","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"12_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","volume":"83","author":"P Schnoebelen","year":"2002","unstructured":"Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. 83(5), 251\u2013261 (2002). \n                    https:\/\/doi.org\/10.1016\/S0020-0190(01)00337-4","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30806-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:08:54Z","timestamp":1567760934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30806-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030308056","9783030308063"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30806-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brussels","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.uclouvain.be\/rp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}