{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:23:21Z","timestamp":1778300601802,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00033-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"211-250","source":"Crossref","is-referenced-by-count":49,"title":["Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations"],"prefix":"10.1016","volume":"221","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":"78","reference":[{"key":"10.1016\/S0304-3975(99)00033-X_bib1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1006\/inco.1996.0053","article-title":"Verifying programs with unreliable channels","volume":"127","author":"Abdulla","year":"1996","journal-title":"Inform. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(99)00033-X_bib2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","article-title":"The algorithmic analysis of hybrid systems","volume":"138","author":"Alur","year":"1995","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(99)00033-X_bib3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"A theory of timed automata","volume":"126","author":"Alur","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00033-X_bib4","article-title":"Finite state description of communication protocols","volume":"2","author":"Bochmann","year":"1978","journal-title":"Comput. Networks"},{"key":"10.1016\/S0304-3975(99)00033-X_bib5","series-title":"CAV'96","article-title":"Symbolic verification of communication protocols with infinite state spaces using QDDs","volume":"vol. 1102","author":"Boigelot","year":"1996"},{"key":"10.1016\/S0304-3975(99)00033-X_bib6","series-title":"Static Analysis Symp.","article-title":"The power of QDDs","volume":"vol. 1302","author":"Boigelot","year":"1997"},{"key":"10.1016\/S0304-3975(99)00033-X_bib7","series-title":"CAV'94","article-title":"Symbolic verification with periodic sets","volume":"vol. 818","author":"Boigelot","year":"1994"},{"key":"10.1016\/S0304-3975(99)00033-X_bib8","series-title":"CONCUR'97","article-title":"Reachability analysis of pushdown automata: application to model checking","volume":"vol. 1243","author":"Bouajjani","year":"1997"},{"key":"10.1016\/S0304-3975(99)00033-X_bib9","series-title":"Infinity'96","article-title":"Reachability analysis of pushdown automata","author":"Bouajjani","year":"1996"},{"issue":"5","key":"10.1016\/S0304-3975(99)00033-X_bib10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","article-title":"On communicating finite-state machines","volume":"2","author":"Brand","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00033-X_bib11","series-title":"Infinity'96","article-title":"Model-checking of infinite graphs defined by graph grammars","author":"Burkart","year":"1996"},{"issue":"1","key":"10.1016\/S0304-3975(99)00033-X_bib12","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1006\/inco.1996.0003","article-title":"Unreliable channels are easier to verify than perfect channels","volume":"124","author":"C\u00e9c\u00e9","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00033-X_bib13","article-title":"Verification of infinite regular communicating automata","author":"Finkel","year":"1996"},{"key":"10.1016\/S0304-3975(99)00033-X_bib14","series-title":"Infinity'97","article-title":"A direct symbolic approach to model checking pushdown systems","author":"Finkel","year":"1997"},{"issue":"1","key":"10.1016\/S0304-3975(99)00033-X_bib15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(93)90212-C","article-title":"Testing for unboundedness of Fifo channels","volume":"113","author":"J\u00e9ron","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00033-X_bib16","series-title":"ESOP'96","article-title":"Checking system properties via integer programming","volume":"vol. 1058","author":"Melzer","year":"1996"},{"key":"10.1016\/S0304-3975(99)00033-X_bib17","series-title":"Protocol Specification, Testing, and Verification VII","first-page":"207","article-title":"Protocol description and analysis based on a state transition model with channel expressions","author":"Pachl","year":"1987"},{"issue":"3","key":"10.1016\/S0304-3975(99)00033-X_bib18","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/117009.117015","article-title":"Data flow analysis of communicating finite state machines","volume":"13","author":"Peng","year":"1991","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(99)00033-X_bib19","series-title":"FORTE\/PSTV'96","article-title":"Finitely representing infinite reachability graphs of CFSMs with graph grammars","author":"Quemener","year":"1996"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900033X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900033X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:27:37Z","timestamp":1556522857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759900033X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S030439759900033X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00033-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}