{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:59:13Z","timestamp":1725551953290},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311393"},{"type":"electronic","value":"9783540316220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11609773_17","type":"book-chapter","created":{"date-parts":[[2005,12,12]],"date-time":"2005-12-12T07:28:57Z","timestamp":1134372537000},"page":"252-266","source":"Crossref","is-referenced-by-count":2,"title":["Piecewise FIFO Channels Are Analyzable"],"prefix":"10.1007","author":[{"given":"Naghmeh","family":"Ghafari","sequence":"first","affiliation":[]},{"given":"Richard","family":"Trefler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-49059-0_15","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"P.A. Abdulla","year":"1999","unstructured":"Abdulla, P.A., Annichini, A., Bouajjani, A.: Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 208\u2013222. Springer, Heidelberg (1999)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. In: Proc. of LICS 1993, pp. 160\u2013170 (1993)","DOI":"10.1109\/LICS.1993.287591"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-45627-9_13","volume-title":"SOFSEM 2001: Theory and Practice of Informatics","author":"P. Argon","year":"2001","unstructured":"Argon, P., Delzanno, G., Mukhopadhyay, S., Podelski, A.: Model checking for communication protocols. In: Pacholski, L., Ru\u017ei\u010dka, P. (eds.) SOFSEM 2001. LNCS, vol.\u00a02234, p. 160. Springer, Heidelberg (2001)"},{"key":"17_CR4","unstructured":"Boigelot, B.: Symbolic method for exploring infinite states spaces. PhD thesis, Universit\u00e9 de Li\u00e8ge (1998)"},{"issue":"3","key":"17_CR5","first-page":"237","volume":"14","author":"B. Boigelot","year":"1999","unstructured":"Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using QDDs. FMSD\u00a014(3), 237\u2013255 (1999)","journal-title":"FMSD"},{"key":"17_CR6","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. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 172\u2013186. Springer, Heidelberg (1997)"},{"key":"17_CR7","unstructured":"Bond, G.W., Ivan\u010di\u0107, F., Klarlund, N., Trefler, R.: Eclipse feature logic analysis. In: Second IP Telephony Workshop (2001)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nillson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855. Springer, Heidelberg (2000)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Muscholl, A., Touili, T.: Permutation rewriting and algorithmic verification. In: Proc. of LICS 2001 (2001)","DOI":"10.1109\/LICS.2001.932515"},{"issue":"2","key":"17_CR10","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\u00a030(2), 323\u2013342 (1983)","journal-title":"J. ACM"},{"key":"17_CR11","unstructured":"Buchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. of Int. Cong. on Logic, Methodology, and Philosophy of Science (1960)"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. Cece","year":"1996","unstructured":"Cece, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Information and Computation\u00a0124(1), 20\u201331 (1996)","journal-title":"Information and Computation"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0890-5401(02)00027-5","volume":"181","author":"A. Finkel","year":"2003","unstructured":"Finkel, A., Iyer, S.P., Sutre, G.: Well-abstracted transition systems: Application to FIFO automata. Information and Computation\u00a0181(1), 1\u201331 (2003)","journal-title":"Information and Computation"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-50580-6_26","volume-title":"Advances in Petri Nets 1988","author":"A. Finkel","year":"1988","unstructured":"Finkel, A., Rosier, L.: A survey on the decidability questions for classes of FIFO nets. In: Rozenberg, G. (ed.) APN 1988. LNCS, vol.\u00a0340, pp. 106\u2013132. Springer, Heidelberg (1988)"},{"issue":"10","key":"17_CR15","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1109\/32.729683","volume":"24","author":"M. Jackson","year":"1998","unstructured":"Jackson, M., Zave, P.: Distributed Feature Composition: A virtual architecture for telecommunications services. IEEE Trans. on Soft. Eng.\u00a024(10), 831\u2013847 (1998)","journal-title":"IEEE Trans. on Soft. Eng."},{"issue":"1\u20132","key":"17_CR16","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(00)00103-1","volume":"256","author":"Y. Kesten","year":"2001","unstructured":"Kesten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic model checking with rich assertional languages. Theo. Comp. Sci.\u00a0256(1\u20132), 93\u2013112 (2001)","journal-title":"Theo. Comp. Sci."},{"key":"17_CR17","unstructured":"Klarlund, N., Trefler, R.: Regularity results for fifo channels. In: Proc. of AVoCS 2004 (2004) To appear in Electronic Notes in Theoretical Computer Science"},{"key":"17_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-15641-0","volume-title":"Automata on Infinite Words","author":"M. Nivat","year":"1985","unstructured":"Nivat, M., Perrin, D.: Automata on Infinite Words. Springer, Heidelberg (1985)"},{"key":"17_CR19","unstructured":"Pachl, J.K.: Protocol description and analysis based on a state transition model with channel expressions. In: Proc. of PSTV, pp. 207\u2013219 (1987)"},{"key":"17_CR20","series-title":".","volume-title":"Handbook of language theory","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of language theory., vol.\u00a0I. Springer, Heidelberg (1997)"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02679450","volume":"30","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Systems\u00a030, 1\u201339 (1997)","journal-title":"Theory Comput. Systems"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. 18th FOCS, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"17_CR23","first-page":"214","volume":"33","author":"I. Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. Proc. of 2nd GI Conf.\u00a033, 214\u2013222 (1975)","journal-title":"Proc. of 2nd GI Conf."},{"key":"17_CR24","unstructured":"Vardi, M., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. of LICS 1986, pp. 332\u2013344 (1986)"},{"key":"17_CR25","unstructured":"Zave, P., Jackson, M.: DFC Manual. AT&T (2001) Updated as needed. Available from, \n                  \n                    http:\/\/www.research.att.com\/projects\/dfc"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11609773_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:07:00Z","timestamp":1619507220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11609773_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540311393","9783540316220"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11609773_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}