{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:38:14Z","timestamp":1694623094763},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2004,5]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n          <jats:p>\n            This paper investigates the logic-automata-connection for Duration Calculus. It has been frequently observed that Duration Calculus with linear duration terms comes close to being a logic of linear hybrid automata. We attempt to make this relation precise by constructing Kleene-connection between\n            <jats:italic>duration-constrained regular expressions<\/jats:italic>\n            and a subclass of linear hybrid automata called\n            <jats:italic>loop-reset automata<\/jats:italic>\n            in which any variable tested in a loop is reset in the same loop. The formalism of duration-constrained regular expressions is an extension of regular expressions with duration constraints, which are essentially formulas of Duration Calculus without negation, yet extended by a Kleene-star operator. In this paper, we show that this formalism is equivalent in expressive power to loop-reset automata by providing a translation procedure from expressions to automata and vice verse.\n          <\/jats:p>","DOI":"10.1007\/s00165-004-0033-x","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T06:58:17Z","timestamp":1083049097000},"page":"155-163","source":"Crossref","is-referenced-by-count":0,"title":["Duration-constrained regular expressions"],"prefix":"10.1145","volume":"16","author":[{"given":"Li","family":"Xuandong","sequence":"first","affiliation":[{"name":"State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, P.R. China"},{"name":"Department of Computer Science and Technology, Nanjing University, 210093, Jiangsu, Nanjing, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Jianhua","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, P.R. China"},{"name":"Department of Computer Science and Technology, Nanjing University, 210093, Jiangsu, Nanjing, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Tao","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, P.R. China"},{"name":"Department of Computer Science and Technology, Nanjing University, 210093, Jiangsu, Nanjing, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Yong","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, P.R. China"},{"name":"Department of Computer Science and Technology, Nanjing University, 210093, Jiangsu, Nanjing, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Guoliang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, P.R. China"},{"name":"Department of Computer Science and Technology, Nanjing University, 210093, Jiangsu, Nanjing, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"p_1","volume-title":"Winskel G (eds) 12th Annual IEEE symposium on logic in computer science (LICS'97)","author":"Asarin E","year":"1997"},{"key":"p_2","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 R","year":"1995","journal-title":"Theor Comput Sci"},{"key":"p_3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-56922-7_16","volume-title":"Proc. the fifth conference on computer-aided verification, LNCS 693","author":"Alur R","year":"1993"},{"issue":"5","key":"p_4","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 Z","year":"1991","journal-title":"Information Processing Letter"},{"key":"p_5","first-page":"88","volume-title":"Formal techniques in real-time and faulttolerant systems, LNCS 863","author":"Chaochen Z","year":"1994"},{"key":"p_6","volume-title":"Proceedings of the sixth workshop on tools and algorithms for the construction and analysis of systems (TACAS 00)","author":"Henzinger TA","year":"2000"},{"key":"p_7","first-page":"278","volume-title":"Proceedings of the 11th annual IEEE symposium on logic in computer science (LICS","author":"Hen TA","year":"1996"},{"key":"p_8","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/jcss.1998.1581","article-title":"What's decidable about hybrid automata","volume":"57","author":"Henzinger TA","year":"1998","journal-title":"J Comput Syst Sci"},{"key":"p_9","first-page":"179","volume-title":"Hybrid system, LNCS 736","author":"Kesten Y","year":"1994"},{"key":"p_10","first-page":"10","volume-title":"IEEE computer, Vol 18. No. 2","author":"Mos B","year":"1985"},{"key":"p_11","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-63875-X_51","volume-title":"Advances in computing science - ASIAN'97, LNCS 1345","author":"Xuandong L","year":"1997"},{"key":"p_12","first-page":"384","volume-title":"Hybrid systems: computation and control, LNCS 1386","author":"Xuandong L","year":"1998"},{"key":"p_13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BFb0027804","volume-title":"Concurrency and parallelism, programming, network, and security, LNCS 1179","author":"Xuandong L","year":"1996"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-004-0033-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-004-0033-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-004-0033-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:34:17Z","timestamp":1641483257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-004-0033-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["10.1007\/s00165-004-0033-x"],"URL":"https:\/\/doi.org\/10.1007\/s00165-004-0033-x","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}