{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:16Z","timestamp":1725664996778},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643586"},{"type":"electronic","value":"9783540697541"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-64358-3_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:37:21Z","timestamp":1330299441000},"page":"384-399","source":"Crossref","is-referenced-by-count":4,"title":["Hybrid regular expressions"],"prefix":"10.1007","author":[{"given":"Li","family":"Xuandong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hou","family":"Jianmin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Jianhua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Guoliang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Thomas A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS 1996), pp. 278\u2013292.","DOI":"10.1109\/LICS.1996.561342"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H.Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine. The algorithmic analysis of hybrid systems. In Theoretical Computer Science, 138 (1995), pp.3\u201334.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"26_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","volume":"40","author":"Z. Chaochen","year":"1991","unstructured":"Zhou Chaochen, C.A.R. Hoare, A.P. Ravn. A Calculus of Durations. In Information Processing Letter, 40, 5, 1991, pp.269\u2013276.","journal-title":"Information Processing Letter"},{"key":"26_CR4","unstructured":"Zhou Chaochen, Zhang Jingzhong, Yang Lu and Li Xiaoshan. Linear Duration Invariants. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pp.88\u2013109."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Y. Kesten, A. Pnueli, J. Sifakis, S. Yovine. Integration Graphs: A Class of Decidable Hybrid Systems. In Hybrid System, LNCS 736, pp.179\u2013208.","DOI":"10.1007\/3-540-57318-6_29"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Rajeev Alur, Costas Courcoudetis, and Thomas A. Henzinger. Computing Accumulated Delays in Real-time Systems. In Proc. CAV'93, LNCS 818, pp.181\u2013193.","DOI":"10.1007\/3-540-56922-7_16"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What's Decidable About Hybrid Automata? In Proc. of the 27th Annual ACM Symposium on Theorey of Computing (STOC), 1995, pp.373\u2013382.","DOI":"10.1145\/225058.225162"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Eugene Asarin, Paul Caspi, Oded Mater. A Kleene Theorem for Timed Automata. In Proceedings of Logic in Computer Science, IEEE Comp. Soc., 1997.","DOI":"10.1109\/LICS.1997.614944"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Li Xuandong, Dang Van Hung. Checking Linear Duration Invariants by Linear Programming. In Concurrence and Parallelism, Programming, Networking, and Security, LNCS 1179, pp.321\u2013332.","DOI":"10.1007\/BFb0027804"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Li Xuandong, Dang Van Hung, and Zheng Tao. Checking Hybrid Automata for Linear Duration Invariants. In Advance in Computing Science-ASIAN'97, LNCS 1345, pp.166\u2013180.","DOI":"10.1007\/3-540-63875-X_51"}],"container-title":["Lecture Notes in Computer Science","Hybrid Systems: Computation and Control"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-64358-3_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:20:02Z","timestamp":1605648002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-64358-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643586","9783540697541"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-64358-3_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}