{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:37:10Z","timestamp":1761590230053,"version":"build-2065373602"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4070,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic and Algebraic Programming"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1567-8326(02)00024-3","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T00:01:59Z","timestamp":1034294519000},"page":"79-108","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Positive loop-closed automata: a decidable class of hybrid systems"],"prefix":"10.1016","volume":"52-53","author":[{"given":"Xuandong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhua","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S1567-8326(02)00024-3_BIB1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","article-title":"A calculus of durations","volume":"40","author":"Chaochen","year":"1991","journal-title":"Information Processing Letter"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB2","series-title":"in: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS 1996)","first-page":"278","article-title":"The theory of hybrid automata","author":"Henzinger","year":"1996"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB3","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":"Theoretical Computer Science"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB4","series-title":"in: Formal Techniques in Real-Time and Fault-Tolerant Systems","first-page":"88","article-title":"Linear duration invariants","volume":"vol. 863","author":"Chaochen","year":"1994"},{"issue":"2","key":"10.1016\/S1567-8326(02)00024-3_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1006\/inco.1998.2774","article-title":"Decidable integration graphs","volume":"150","author":"Kesten","year":"1999","journal-title":"Information and Computation"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB6","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, P.W. Kopke, Anuj Puri, Pravin Varaiya, What\u2019s decidable about hybrid automata? Journal of Computer and System Sciences 57 (1998) 94\u2013124","DOI":"10.1006\/jcss.1998.1581"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB7","series-title":"in: Proceedings of the Sixth Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 00)","article-title":"Symbolic model checking for rectangular hybrid systems","author":"Henzinger","year":"2000"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB8","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/s100090050008","article-title":"HYTECH: a model checker for hybrid systems","volume":"1","author":"Henzinger","year":"1997","journal-title":"Software Tools for Technology Transfer"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB9","series-title":"in: Proceedings of the Fifth Conference on Computer-Aided Verification","first-page":"181","article-title":"Computing accumulated delays in real-time systmes","volume":"vol. 818","author":"Alur","year":"1993"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB10","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":"Theoretical Computer Science"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB11","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1109\/9.664156","article-title":"Algorithmic analysis of nonlinear hybrid systems","volume":"43","author":"Henzinger","year":"1998","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB12","series-title":"in: Proceedings of the First International Workshop on Hybrid Systems: Computation and Control (HSCC 1998)","first-page":"190","article-title":"Reachability verification for hybrid automata","volume":"vol. 1386","author":"Henzinger","year":"1998"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB13","series-title":"in: Proceedings of the International Symposium on Static Analysis","article-title":"Verification of linear hybrid systems by means of convex approximations","author":"Halbwachs","year":"1994"},{"issue":"8","key":"10.1016\/S1567-8326(02)00024-3_BIB14","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1109\/32.707696","article-title":"Analyzing partially-implemented real-time systems","volume":"24","author":"Avrunin","year":"1998","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB15","series-title":"in: Proceedings of Logic in Computer Science","first-page":"160","article-title":"A Kleene theorem for timed automata","author":"Asarin","year":"1997"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB16","series-title":"in: Formal Techniques in Real-Time and Fault-Tolerant Systems","first-page":"241","article-title":"On checking parallel real-time systems for linear duration properties","volume":"vol. 1486","author":"Jianhua","year":"1998"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB17","unstructured":"Z. Jianhua, D. Van Hung, Checking timed automata for some discretisable duration properties, Research Report 145, UNU\/IIST, Macau, 1998"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB18","series-title":"in: Correct Hardware Design and Verification Methods","first-page":"465","article-title":"Efficient verification of a class of linear hybrid automata using linear programming","volume":"vol. 2144","author":"Xuandong","year":"2001"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB19","series-title":"in: Advances in Computing Science\u2014ASIAN\u201997","first-page":"166","article-title":"Checking hybrid automata for linear duration invariants","volume":"vol. 1345","author":"Xuandong","year":"1997"},{"key":"10.1016\/S1567-8326(02)00024-3_BIB20","series-title":"in: Hybrid Systems: Computation and Control","first-page":"384","article-title":"Hybrid regular expressions","volume":"vol. 1386","author":"Xuandong","year":"1998"}],"container-title":["The Journal of Logic and Algebraic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832602000243?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832602000243?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:34:58Z","timestamp":1761590098000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1567832602000243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":20,"alternative-id":["S1567832602000243"],"URL":"https:\/\/doi.org\/10.1016\/s1567-8326(02)00024-3","relation":{},"ISSN":["1567-8326"],"issn-type":[{"type":"print","value":"1567-8326"}],"subject":[],"published":{"date-parts":[[2002,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Positive loop-closed automata: a decidable class of hybrid systems","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic and Algebraic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1567-8326(02)00024-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}