{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:16:36Z","timestamp":1773407796779,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540631651","type":"print"},{"value":"9783540691945","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/3-540-63165-8_211","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:11:28Z","timestamp":1330279888000},"page":"560-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Habermehl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P. Abdulla","year":"1996","unstructured":"P. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127:91\u2013101, 1996.","journal-title":"Information and Computation"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The Algorithmic Analysis of Hybrid Systems. TCS, 138, 1995.","DOI":"10.1016\/0304-3975(94)00202-T"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"R. Alur and D. Dill. A Theory of Timed Automata. TCS, 126, 1994.","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"G.V. Bochmann. Finite State Description of Communication Protocols. Computer Networks, 2, October 1978.","DOI":"10.1016\/0376-5075(78)90015-6"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"B. Boigelot and P. Godefroid. Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. In CAV'96. LNCS 1102, 1996.","DOI":"10.1007\/3-540-61474-5_53"},{"key":"53_CR6","doi-asserted-by":"crossref","unstructured":"B. Boigelot and P. Wolper. Symbolic Verification with Periodic Sets. In CAV'94. LNCS 818, 1994.","DOI":"10.1007\/3-540-58179-0_43"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR '97, 1997.","DOI":"10.1007\/3-540-63141-0_10"},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. 1997. full version available at http:\/\/www.imag.fr\/VERIMAG\/PEOPLE\/Peter.Habermehl.","DOI":"10.1007\/3-540-63165-8_211"},{"key":"53_CR9","unstructured":"A. Bouajjani and O. Maler. Reachability Analysis of Pushdown Automata. In Infinity'96. tech. rep. MIP-9614, Univ. Passau, 1996."},{"issue":"5","key":"53_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"2","author":"D. Brand","year":"1983","unstructured":"D. Brand and P. Zafiropulo. On communicating finite-state machines. JACM, 2(5):323\u2013342, 1983.","journal-title":"JACM"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"O. Burkart and Y.M. Quemener. Model-Checking of Infinite Graphs Defined by Graph Grammars. In Infinity'96. tech. rep. MIP-9614, Univ. Passau, 1996.","DOI":"10.1016\/S1571-0661(05)80677-2"},{"issue":"1","key":"53_CR12","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. 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_CR13","doi-asserted-by":"crossref","unstructured":"S. Melzer and J. Esparza. Checking System Properties via Integer Programming. In ESOP'96. LNCS 1058, 1996.","DOI":"10.1007\/3-540-61055-3_41"},{"key":"53_CR14","doi-asserted-by":"crossref","unstructured":"R.J. Parikh. On Context-Free Languages. JACM, 13, 1966.","DOI":"10.1145\/321356.321364"},{"issue":"3","key":"53_CR15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/117009.117015","volume":"13","author":"W. Peng","year":"1991","unstructured":"W. Peng and S. Purushotaman Iyer. Data Flow Analysis of Communicating Finite State Machines. ACM Transactions on Programming Languages and Systems, 13(3):399\u2013442, July 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"53_CR16","doi-asserted-by":"crossref","unstructured":"Y.M. Quemener and T. J\u00e9ron. Finitely Representing Infinite Reachability Graphs of CFSMs with Graph Grammars. In FORTE\/PSTV'96. Chapman and Hall, 1996.","DOI":"10.1007\/978-0-387-35079-0_23"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63165-8_211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T06:36:43Z","timestamp":1640932603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63165-8_211"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631651","9783540691945"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-63165-8_211","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}