{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:49:39Z","timestamp":1725472179908},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540488156"},{"type":"electronic","value":"9783540488163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11921240_23","type":"book-chapter","created":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T13:28:19Z","timestamp":1162474099000},"page":"332-346","source":"Crossref","is-referenced-by-count":10,"title":["Model Checking Duration Calculus: A Practical Approach"],"prefix":"10.1007","author":[{"given":"Roland","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Faber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrey","family":"Rybalchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0304-3975(02)00334-1","volume":"300","author":"L. Aceto","year":"2003","unstructured":"Aceto, L., Bouyer, P., Burgue\u00f1o, A., Larsen, K.G.: The power of reachability testing for timed automata. Theoretical Computer Science\u00a0300(1-3), 411\u2013475 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"23_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(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-60045-0_51","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"1995","unstructured":"Bouajjani, A., Lakhnech, Y., Robbana, R.: From duration calculus to linear hybrid automata. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 196\u2013210. Springer, Heidelberg (1995)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-45739-9_25","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"H. Dierks","year":"2002","unstructured":"Dierks, H., Lettrari, M.: Constructing test automata from graphical real-time requirements. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol.\u00a02469, pp. 433\u2013453. Springer, Heidelberg (2002)"},{"key":"23_CR6","unstructured":"ERTMS User Group, UNISIG. ERTMS\/ETCS System requirements specification. Version 2.2.2 (2002), http:\/\/www.aeif.org\/ccm\/default.asp"},{"issue":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00165-004-0032-y","volume":"16","author":"M. Fr\u00e4nzle","year":"2004","unstructured":"Fr\u00e4nzle, M.: Model-checking dense-time duration calculus. Formal Aspects of Computing\u00a016(2), 121\u2013139 (2004)","journal-title":"Formal Aspects of Computing"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1997","unstructured":"Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"key":"23_CR9","unstructured":"Hansen, M.: DC with nominals. Personal communication (March 2006)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/964001.964021","volume-title":"POPL","author":"T.A. Henzinger","year":"2004","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: POPL, pp. 232\u2013244. ACM Press, New York (2004)"},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1071021.1071023","volume-title":"WOSP","author":"H. Hermanns","year":"2005","unstructured":"Hermanns, H., Jansen, D.N., Usenko, Y.S.: From StoCharts to MoDeST: a comparative reliability analysis of train radio communications. In: WOSP, pp. 13\u201323. ACM Press, New York (2005)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11526841_31","volume-title":"FM 2005: Formal Methods","author":"J. Hoenicke","year":"2005","unstructured":"Hoenicke, J., Maier, P.: Model-checking of specifications integrating processes, data and time. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol.\u00a03582, pp. 465\u2013480. Springer, Heidelberg (2005)"},{"key":"23_CR13","unstructured":"Hoenicke, J., Meyer, R., Faber, J.: PEA toolkit home page (2006), http:\/\/csd.informatik.uni-oldenburg.de\/projects\/epea.html"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Hoenicke, J., Olderog, E.-R.: CSP-OZ-DC: A combination of specification techniques for processes, data and time. NJC\u00a09 (2002)","DOI":"10.1007\/3-540-47884-1_14"},{"key":"23_CR15","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"23_CR16","unstructured":"Hoenicke, J.: Combination of Processes, Data, and Time. PhD thesis, University of Oldenburg, Germany (to appear, 2006)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11590156_36","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"S.N. Krishna","year":"2005","unstructured":"Krishna, S.N., Pandya, P.K.: Modal strength reduction in quantified discrete duration calculus. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 444\u2013456. Springer, Heidelberg (2005)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 1\u201313. Springer, Heidelberg (2003)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Pandya, P.K.: Interval duration logic: Expressiveness and decidability. ENTCS\u00a065(6) (2002)","DOI":"10.1016\/S1571-0661(04)80480-8"},{"key":"23_CR20","unstructured":"Ravn, A.P.: Design of Embedded Real-Time Computing Systems. PhD thesis, Technical University of Denmark (1994)"},{"key":"23_CR21","unstructured":"Rybalchenko, A.: ARMC (2006), http:\/\/www.mpi-inf.mpg.de\/~rybal\/armc"},{"key":"23_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5265-9","volume-title":"The Object-Z Specification Language","author":"G. Smith","year":"2000","unstructured":"Smith, G.: The Object-Z Specification Language. Kluwer, Dordrecht (2000)"},{"key":"23_CR23","unstructured":"Uppaal home page. University of Aalborg and University of Uppsala (1995-2005), http:\/\/www.uppaal.com"},{"key":"23_CR24","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: LICS, pp. 332\u2013344 (1986)"},{"key":"23_CR25","volume-title":"Duration Calculus","author":"C. Zhou","year":"2004","unstructured":"Zhou, C., Hansen, M.R.: Duration Calculus. Springer, Heidelberg (2004)"},{"issue":"1","key":"23_CR26","first-page":"47","volume":"77","author":"A. Zimmermann","year":"2005","unstructured":"Zimmermann, A., Hommel, G.: Towards modeling and evaluation of ETCS real-time communication and operation. JSS\u00a077(1), 47\u201354 (2005)","journal-title":"JSS"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","first-page":"58","volume-title":"STACS","author":"C. Zhou","year":"1993","unstructured":"Zhou, C., Hansen, M.R., Sestoft, P.: Decidability and undecidability results for duration calculus. In: STACS 1993. LNCS, vol.\u00a0665, pp. 58\u201368. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11921240_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:59:01Z","timestamp":1605643141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11921240_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540488156","9783540488163"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11921240_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}