{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:15:24Z","timestamp":1761610524589,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":4958,"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":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80751-0","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"258-272","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Real-Time Verification Techniques for Untimed Systems"],"prefix":"10.1016","volume":"39","author":[{"given":"Xiaoqun","family":"Du","sequence":"first","affiliation":[]},{"given":"C.R.","family":"Ramakrishnan","sequence":"additional","affiliation":[]},{"given":"Scott A.","family":"Smolka","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80751-0_BIB1","first-page":"313","article-title":"General decidability theorems for infinite-state systems","author":"Abdulla","year":"1996"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB2","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"},{"year":"1991","series-title":"Concurrent Programming: Principles and Practice","author":"Andrews","key":"10.1016\/S1571-0661(05)80751-0_BIB3"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB4","first-page":"95","article-title":"Verifying infinite state processes with sequential and parallel composition","author":"Bouajjani","year":"1995"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB5","first-page":"400","article-title":"Symbolic model checking of infinite-state systems using Presburger Arithmetics","author":"Bultan","year":"1997"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB6","series-title":"Proceedings of ICALP'94, volume 820 of Lecture Notes in Computer Science","first-page":"35","article-title":"Deciding properties of integral relational automata","author":"\u010cer\u0101ns","year":"1994"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB7","first-page":"223","article-title":"Model checking in CLP","volume":"volume 1579","author":"Delzanno","year":"1999"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB8","series-title":"International Journal on Software Tools for Technology Transfer","article-title":"Constraint-based deductive model checking in CLP","author":"Delzanno","year":"2000"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB9","first-page":"102","article-title":"Fundamental structures in well-structured infinite transition systems","author":"Finkel","year":"1998"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","article-title":"On the reachability problem for 5-dimensional vector addition systems","volume":"8","author":"Hopcroft","year":"1979","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the prepositional \u03bc-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoretical Computer Science"},{"issue":"8","key":"10.1016\/S1571-0661(05)80751-0_BIB12","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/361082.361093","article-title":"A new solution of Dijkstra's concurrent programming problem","volume":"17","author":"Lamport","year":"1974","journal-title":"Communications of the ACM"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB13","article-title":"Automatic verification of parameterized networks of processes by abstraction","author":"Lesens","year":"1997","journal-title":"In Proceedings of the 2nd International Workshop on Verification of Infinite State Systems (INFINITY'97), Bologna"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB14","series-title":"Proceedings of the 12th International Conference on Computer-Aided Verification (CAV '00)","article-title":"Syntactic program transformations for automatic abstraction","author":"Namjoshi","year":"2000"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB15","series-title":"Computer Systems and Software Engineering: State-of-the-Art.","article-title":"Efficient bottom-up evaluation of logic programs","author":"Ramakrishnan","year":"1992"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB16","series-title":"Tools and Algorithms for the Construction and Analysis of Systems (TAGAS '99), volume 1579 of Lecture Notes in Computer Science","first-page":"178","article-title":"On proving safety properties by integrating static analysis, theorem proving and abstraction","author":"Rusu","year":"1999"},{"issue":"1","key":"10.1016\/S1571-0661(05)80751-0_BIB17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1008791913551","article-title":"Deductive model checking","volume":"15","author":"Sipma","year":"1999","journal-title":"Formal Methods in System Design"},{"key":"10.1016\/S1571-0661(05)80751-0_BIB18","first-page":"142","article-title":"The joys ol bisimulation","author":"Stirling","year":"1998"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105807510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105807510?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:08:52Z","timestamp":1761610132000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105807510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000]]}},"alternative-id":["S1571066105807510"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80751-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Real-Time Verification Techniques for Untimed Systems","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)80751-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}