{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T18:28:28Z","timestamp":1672338508008},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0890-5401(02)00027-5","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T16:48:43Z","timestamp":1043945323000},"page":"1-31","source":"Crossref","is-referenced-by-count":27,"title":["Well-abstracted transition systems: application to FIFO automata"],"prefix":"10.1016","volume":"181","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Purushothaman Iyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gr\u00e9goire","family":"Sutre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(02)00027-5_BIB1","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/3-540-49059-0_15","article-title":"Symbolic verification of lossy channel systems: application to the bounded retransmission protocol","volume":"1579","author":"Abdulla","year":"1999","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB2","doi-asserted-by":"crossref","unstructured":"P.A. Abdulla, K. \u010cer\u0101ns, B. Jonsson, T. Yih-Kuen, General decidability theorems for infinite-state systems, in: Proc. 11th IEEE Symp. Logic in Computer Science (LICS\u201996), New Brunswick, NJ, USA, July 1996, pp. 313\u2013321","DOI":"10.1109\/LICS.1996.561359"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(80)90037-7","article-title":"The complexity of logical theories","volume":"11","author":"Berman","year":"1980","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB4","first-page":"172","article-title":"The power of QDDs","volume":"vol. 1302","author":"Boigelot","year":"1997"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB5","series-title":"Proc. 24th Int. Coll. Automata, Languages, and Programming (ICALP\u201997), Bologna, Italy, July 1997","first-page":"560","article-title":"Symbolic reachability analysis of FIFOchannel systems with nonregular sets of configurations","volume":"vol. 1256","author":"Bouajjani","year":"1997"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB6","series-title":"Proc. 12th Int. Conf. Computer Aided Verification (CAV\u20192000), Chicago, USA, July 2000","first-page":"403","article-title":"Regular model checking","volume":"vol. 1855","author":"Bouajjani","year":"2000"},{"issue":"2","key":"10.1016\/S0890-5401(02)00027-5_BIB7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","article-title":"On communicating finite-state machines","volume":"30","author":"Brand","year":"1983","journal-title":"Journal of the ACM"},{"issue":"4","key":"10.1016\/S0890-5401(02)00027-5_BIB8","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","article-title":"Derivatives of regular expressions","volume":"1","author":"Brzozowski","year":"1964","journal-title":"Journal of the ACM"},{"issue":"2","key":"10.1016\/S0890-5401(02)00027-5_BIB9","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","article-title":"Symbolic model checking: 1020 states and beyond","volume":"98","author":"Burch","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB10","unstructured":"G. C\u00e9c\u00e9, V\u00e9rification, analyse et approximations symboliques des automates communicants, Th\u00e8se ENS de Cachan, January 1998"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB11","series-title":"Proc. 14th Int. Workshop Computer Science Logic (CSL\u20192000), Fischbachau, Germany, Aug. 2000","first-page":"262","article-title":"Flatness is not a weakness","volume":"vol. 1862","author":"Comon","year":"2000"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB12","series-title":"Proc. 10th Int. Conf. Computer Aided Verification (CAV\u201998), Vancouver, BC, Canada, June\u2013July 1998","first-page":"268","article-title":"Multiple counters automata, safety analysis and Presburger arithmetic","volume":"vol. 1427","author":"Comon","year":"1998"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB13","series-title":"Proc. 10th Int. Conf. Concurrency Theory (CONCUR\u201999), Eindhoven, The Netherlands, August 1999","first-page":"242","article-title":"Timed automata and the theory of real numbers","volume":"vol. 1664","author":"Comon","year":"1999"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB14","series-title":"Conference Record of the Fourth Annual Symposium on Principles of Programming Languages","first-page":"238","article-title":"Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints","author":"Cousot","year":"1977"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB15","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, K.S. Namjoshi, On model checking for non-deterministic infinite-state systems, in: Proc. 13th IEEE Symp. Logic in Computer Science (LICS\u201998), Indianapolis, IN, USA, June 1998, pp. 70\u201380","DOI":"10.1109\/LICS.1998.705644"},{"issue":"2","key":"10.1016\/S0890-5401(02)00027-5_BIB16","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","article-title":"Reduction and covering of infinite reachability trees","volume":"89","author":"Finkel","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB17","unstructured":"A. Finkel, O. Marc\u00e9, A minimal symbolic coverability graph for infinite-state comunicating automata, Technical report, LIFAC, 1996"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB18","series-title":"Advances in Petri Nets 1988","first-page":"106","article-title":"A survey on the decidability questions for classes of FIFO nets","author":"Finkel","year":"1988"},{"issue":"1\/2","key":"10.1016\/S0890-5401(02)00027-5_BIB19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","article-title":"Well-structured transition systems everywhere !","volume":"256","author":"Finkel","year":"2001","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB20","series-title":"Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS\u20192000), Lille, France, February 2000","first-page":"346","article-title":"Decidability of reachability problems for classes of two counters automata","volume":"vol. 1770","author":"Finkel","year":"2000"},{"issue":"3\/4","key":"10.1016\/S0890-5401(02)00027-5_BIB21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1009747629591","article-title":"A decompositional approach for computing least fixed-points of datalog programs with Z-counters","volume":"2","author":"Fribourg","year":"1997","journal-title":"Constraints"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB22","series-title":"Proc. 8th Int. Conf. Concurrency Theory (CONCUR\u201997), Warsaw, Poland, Jul. 1997","first-page":"213","article-title":"Proving safety properties of infinite state systems by compilation into Presburger arithmetic","volume":"vol. 1243","author":"Fribourg","year":"1997"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB23","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"issue":"3","key":"10.1016\/S0890-5401(02)00027-5_BIB24","first-page":"209","article-title":"On deadlock detection in systems of communicating finite state machines","volume":"6","author":"Gouda","year":"1987","journal-title":"Computers and Artificial Intelligence"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB25","doi-asserted-by":"crossref","unstructured":"P. Habermehl, R. Mayr. A note on SLRE, October 2000, personal communication","DOI":"10.1016\/S1571-0661(05)01233-8"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB26","series-title":"Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS\u20192000), Lille, France, February 2000","first-page":"13","article-title":"A classification of symbolic transition systems","volume":"vol. 1770","author":"Henzinger","year":"2000"},{"issue":"2","key":"10.1016\/S0890-5401(02)00027-5_BIB27","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0022-0000(76)80038-4","article-title":"On the equivalence, containment, and covering problems for the regular and context-free languages","volume":"12","author":"Hunt III","year":"1976","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"10.1016\/S0890-5401(02)00027-5_BIB28","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":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/S0890-5401(02)00027-5_BIB29","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"Journal of Computer and System Sciences"},{"issue":"2\u20133","key":"10.1016\/S0890-5401(02)00027-5_BIB30","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(85)90014-3","article-title":"An introduction to FIFO nets-monogeneous nets: a subclass of FIFO nets","volume":"35","author":"Memmi","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB31","unstructured":"J.K. Pachl, Protocol description and analysis based on a state transition model with channel expressions, in: Proc. of Protocol Specification, Testing and Verification, VII, 1987"},{"issue":"3","key":"10.1016\/S0890-5401(02)00027-5_BIB32","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 Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB33","series-title":"Combinatorics on Words","article-title":"Words","volume":"vol. 17","author":"Perrin","year":"1983"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB34","doi-asserted-by":"crossref","unstructured":"L.J. Stockmeyer, A.R. Meyer, Word problems requiring exponential time: preliminary report, in: Proc. 5th ACM Symp. Theory of Computing (STOC\u201973), Austin, TX, USA, April\u2013May 1973, pp. 1\u20139","DOI":"10.1145\/800125.804029"},{"key":"10.1016\/S0890-5401(02)00027-5_BIB35","first-page":"41","article-title":"Regular languages","volume":"vol. 1","author":"Yu","year":"1997"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000275?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000275?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T05:57:48Z","timestamp":1553925468000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540102000275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0890540102000275"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(02)00027-5","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}