{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:56Z","timestamp":1761611216206},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_53","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"639-651","source":"Crossref","is-referenced-by-count":5,"title":["Effective Lossy Queue Languages"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[]},{"given":"Luc","family":"Boasson","sequence":"additional","affiliation":[]},{"given":"Ahmed","family":"Bouajjani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"53_CR1","series-title":"Lect Notes Comput Sci","volume-title":"TACAS\u201999","author":"P. A. Abdulla","year":"1999","unstructured":"Parosh Aziz Abdulla, Aurore Annichini, and Ahmed Bouajjani. Algorithmic verification of lossy channel systems: An application to the bounded retransmission protocol. In TACAS\u201999. LNCS 1579, 1999."},{"key":"53_CR2","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201998","author":"P. A. Abdulla","year":"1998","unstructured":"Parosh Aziz Abdulla, Ahmed Bouajjani, and Bengt Jonsson. On-the-fly analysis of systems with unbounded, lossy fifo channels. In CAV\u201998. LNCS 1427, 1998."},{"issue":"2","key":"53_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P. A. Abdulla","year":"1996","unstructured":"Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91\u2013101, 1996.","journal-title":"Information and Computation"},{"key":"53_CR4","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/174130.174141","volume":"40","author":"J.C.M. Baeten","year":"1993","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM, (40):653\u2013682, 1993.","journal-title":"Journal of the ACM"},{"key":"53_CR5","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201996","author":"B. Boigelot","year":"1996","unstructured":"B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In CAV\u201996. LNCS 1102, 1996."},{"key":"53_CR6","series-title":"Lect Notes Comput Sci","volume-title":"SAS\u201997","author":"B. Boigelot","year":"1997","unstructured":"B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In SAS\u201997. LNCS 1302, 1997."},{"key":"53_CR7","series-title":"Lect Notes Comput Sci","volume-title":"ICALP\u2019 97","author":"A. Bouajjani","year":"1997","unstructured":"A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. In ICALP\u2019 97. LNCS 1256, 1997."},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"O. Burkart. Queues as processes. Electrnic Notes in Theoretical Computer Science, 18, 1998.","DOI":"10.1016\/S1571-0661(05)80247-6"},{"issue":"1","key":"53_CR9","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1996","unstructured":"G\u00e9rard C\u00e9c\u00e9, Alain Finkel, and S. Purushothaman Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. Information and Computation, 124(1):20\u201331, 1996.","journal-title":"Information and Computation"},{"key":"53_CR10","series-title":"Lect Notes Comput Sci","volume-title":"CONCUR\u2019 92","author":"S. Christensen","year":"1992","unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In CONCUR\u2019 92. LNCS, 1992."},{"key":"53_CR11","first-page":"178","volume":"44","author":"B. Courcelle","year":"1991","unstructured":"B. Courcelle. On constructing obstruction sets of words. EATCS, 44:178\u2013185, June 1991.","journal-title":"EATCS"},{"key":"53_CR12","doi-asserted-by":"crossref","unstructured":"C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. In CAV\u201990, 1990.","DOI":"10.1090\/dimacs\/003\/15"},{"key":"53_CR13","doi-asserted-by":"crossref","unstructured":"J.F. Groote and H. H\u00fcttel. Undecidable equivelences for basic process algebra. Information and Computation, 1994.","DOI":"10.1006\/inco.1994.1101"},{"key":"53_CR14","series-title":"Tech. report","volume-title":"A bounded retransmission protocol for large data packets","author":"J.F. Groote","year":"1993","unstructured":"J.F. Groote and J. van de Pol. A bounded retransmission protocol for large data packets. Tech. report, Dept. of Philosophy, Utrecht University, Oct. 1993."},{"key":"53_CR15","unstructured":"G.J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991."},{"key":"53_CR16","series-title":"Lect Notes Comput Sci","volume-title":"LATIN\u20192000","author":"R. Mayr","year":"2000","unstructured":"R. Mayr. Undecidable problems in unreliable computations. In LATIN\u20192000. LNCS 1776, 2000."},{"key":"53_CR17","unstructured":"G. Rozenberg and A. Salomaa. The Mathematical Theory of L-systems. Academic Press, 1980."},{"key":"53_CR18","series-title":"Lect Notes Comput Sci","volume-title":"CONCUR\u201996","author":"C. Stirling","year":"1996","unstructured":"C. Stirling. Decidability of bisimulation equivalence for normed push-down processes. In CONCUR\u201996. LNCS 1119, 1996."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:28:20Z","timestamp":1556922500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_53","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}