{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:58Z","timestamp":1761610318745,"version":"build-2065373602"},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6053,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1016\/s1571-0661(05)82559-9","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"2-14","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Verifying Invariants by Approximate Image Computation"],"prefix":"10.1016","volume":"9","author":[{"given":"Felice","family":"Balarin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82559-9_BIBACHH93","doi-asserted-by":"crossref","unstructured":"Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger, and Pei-Hsin Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, editors, Hybrid Systems, Lyngby, Denmark, 10-12 Oct. 1991, Proceedings, pages 209-229. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57318-6_30"},{"key":"10.1016\/S1571-0661(05)82559-9_BIBAD90","series-title":"ICALP'90 Automata, languages, and programming: 17th international colloquium.","article-title":"Automata for modelling real-time systems","author":"Alur","year":"1990"},{"key":"10.1016\/S1571-0661(05)82559-9_BIBBAL96","unstructured":"Felice Balarin. Approximate reachability analysis of timed automata. In Proceedings of the 17th Real-Time Systems Symposium, December 1996."},{"key":"10.1016\/S1571-0661(05)82559-9_BIBBC84","series-title":"Seminar on Concurrency","first-page":"369","article-title":"The ESTEREF synchronous programming language and its mathematical semantics","author":"Berry","year":"1984"},{"key":"10.1016\/S1571-0661(05)82559-9_BIBHAL93","unstructured":"Nicholas Halbwachs. Delay analysis in synchronous programs. In Costas Courcoubetis, editor, Computer Aided Verification: 5th International Conference, CAV'93, Elounda, Greece, June\/July 1993, Proceedings, pages 333-346. Springer-Verlag, 1993. FNCS vol. 697."},{"year":"1979","series-title":"Introduction to Automata Theory, languages and Computation","author":"Hopcroft","key":"10.1016\/S1571-0661(05)82559-9_BIBHU79"},{"year":"1994","series-title":"Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach","author":"Robert","key":"10.1016\/S1571-0661(05)82559-9_BIBKUR94"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825599?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825599?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:06Z","timestamp":1761610026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":7,"alternative-id":["S1571066105825599"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82559-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Verifying Invariants by Approximate Image Computation","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)82559-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}