{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:30Z","timestamp":1725563550713},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153747"},{"type":"electronic","value":"9783642153754"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15375-4_32","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T14:04:18Z","timestamp":1282313058000},"page":"462-477","source":"Crossref","is-referenced-by-count":5,"title":["Kleene, Rabin, and Scott Are Available"],"prefix":"10.1007","author":[{"given":"Jochen","family":"Hoenicke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst-R\u00fcdiger","family":"Olderog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/506147.506151","volume":"49","author":"E. Asarin","year":"2002","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of the ACM\u00a049, 172\u2013206 (2002)","journal-title":"Journal of the ACM"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"5-6","key":"32_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10009-007-0044-z","volume":"9","author":"D. Beyer","year":"2007","unstructured":"Beyer, D., Henzinger, T.A., Jhala, R., Majumdar, R.: The software model checker BLAST. STTT\u00a09(5-6), 505\u2013525 (2007)","journal-title":"STTT"},{"key":"32_CR4","first-page":"1","volume-title":"Proc. of POPL","author":"T. Ball","year":"2002","unstructured":"Ball, T., Rajamani, S.K.: The SLAM project: debugging system software via static analysis. In: Proc. of POPL, pp. 1\u20133. ACM, New York (2002)"},{"key":"32_CR5","series-title":"EATCS Monographs","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06784-0","volume-title":"Duration Calculus: A Formal Approach to Real-Time Systems","author":"Z. Chaochen","year":"2004","unstructured":"Chaochen, Z., Hansen, M.R.: Duration Calculus: A Formal Approach to Real-Time Systems. EATCS Monographs. Springer, Heidelberg (2004)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-44618-4_12","volume-title":"CONCUR 2000 - Concurrency Theory","author":"F. Cassez","year":"2000","unstructured":"Cassez, F., Larsen, K.G.: The impressive power of stopwatches. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 138\u2013152. Springer, Heidelberg (2000)"},{"key":"32_CR7","series-title":"EATCS Monographs","volume-title":"Handbook of Weighted Automata","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs. Springer, Heidelberg (2009)"},{"issue":"1","key":"32_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/58562.59307","volume":"36","author":"E. Silva de Souza e","year":"1989","unstructured":"de Souza e Silva, E., Gail, H.R.: Calculating availability and performability measures of repairable computer systems using randomization. Journal of the ACM\u00a036(1), 171\u2013193 (1989)","journal-title":"Journal of the ACM"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2007.09.021","volume":"390","author":"K.G. Larsen","year":"2008","unstructured":"Larsen, K.G., Rasmussen, J.I.: Automata-theoretic techniques for modal logics of programs. Theoretical Computer Science\u00a0390, 197\u2013213 (2008)","journal-title":"Theoretical Computer Science"},{"key":"32_CR10","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)"},{"issue":"2","key":"32_CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.S.: Finite automata and their decision problems. IBM Journal of Research\u00a03(2), 115\u2013125 (1959)","journal-title":"IBM Journal of Research"},{"key":"32_CR12","first-page":"48","volume-title":"Proc. of FTCS","author":"G. Rubino","year":"1993","unstructured":"Rubino, G., Sericola, B.: Interval availability distribution computation. In: Proc. of FTCS, pp. 48\u201355. IEEE, Los Alamitos (1993)"},{"key":"32_CR13","first-page":"155","volume-title":"Proc. of PODS","author":"H. Seidl","year":"2003","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: Proc. of PODS, pp. 155\u2013166. ACM, New York (2003)"},{"key":"32_CR14","volume-title":"Probability and Statistics with Reliability, Queuing, and Computer Science Applications","author":"K.S. Trivedi","year":"2001","unstructured":"Trivedi, K.S.: Probability and Statistics with Reliability, Queuing, and Computer Science Applications, 2nd edn. Wiley, Chichester (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2010 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15375-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:19:36Z","timestamp":1558286376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15375-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153747","9783642153754"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15375-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}