{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T06:04:25Z","timestamp":1746079465649},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_25","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:43:16Z","timestamp":1133797396000},"page":"310-321","source":"Crossref","is-referenced-by-count":9,"title":["On Sampled Semantics of Timed Systems"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Kr\u010d\u00e1l","sequence":"first","affiliation":[]},{"given":"Radek","family":"Pel\u00e1nek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","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":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 1\u201324. Springer, Heidelberg (2004)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/BFb0055642","volume-title":"CONCUR \u201998 Concurrency Theory","author":"E. Asarin","year":"1998","unstructured":"Asarin, E., Maler, O., Pnueli, A.: On discretization of delays in timed automata and digital circuits. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 470\u2013484. Springer, Heidelberg (1998)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/10722167_35","volume-title":"Computer Aided Verification","author":"P. Bouyer","year":"2000","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Are timed automata updatable? In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 464\u2013479. Springer, Heidelberg (2000)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-63166-6_19","volume-title":"Computer Aided Verification","author":"M. Bozga","year":"1997","unstructured":"Bozga, M., Maler, O., Pnueli, A., Yovine, S.: Some Progress in the Symbolic Verification of Timed Automata. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 179\u2013190. Springer, Heidelberg (1997)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-48153-2_11","volume-title":"Correct Hardware Design and Verification Methods","author":"M. Bozga","year":"1999","unstructured":"Bozga, M., Maler, O., Tripakis, S.: Efficient verification of timed automata using dense and discrete time semantics. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol.\u00a01703, pp. 125\u2013141. Springer, Heidelberg (1999)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-45873-5_13","volume-title":"Hybrid Systems: Computation and Control","author":"F. Cassez","year":"2002","unstructured":"Cassez, F., Henzinger, T.A., Raskin, J.-F.: A comparison of control problems for timed and hybrid systems. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol.\u00a02289, pp. 134\u2013148. Springer, Heidelberg (2002)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-48320-9_18","volume-title":"CONCUR\u201999. Concurrency Theory","author":"H. Comon","year":"1999","unstructured":"Comon, H., Jurski, Y.: Timed automata and the theory of real numbers. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 242\u2013257. Springer, Heidelberg (1999)"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/LICS.2002.1029827","volume-title":"Proc. of Symp. on Logic in Computer Science (LICS 2002)","author":"C. Dima","year":"2002","unstructured":"Dima, C.: Computing reachability relations in timed automata. In: Proc. of Symp. on Logic in Computer Science (LICS 2002), pp. 177\u2013188. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Gollu, A., Puri, A., Varaiya, P.: Discretization of timed automata. In: Proc. of Conferene on Decision and Control, pp. 957\u2013958 (1994)","DOI":"10.1109\/CDC.1994.410933"},{"key":"25_CR11","first-page":"122","volume-title":"Proc. of Principles of programming languages (POPL 2005)","author":"O. Grumberg","year":"2005","unstructured":"Grumberg, O., Lerda, F., Strichman, O., Theobald, M.: Proof-guided underapproximation-widening for multi-process systems. In: Proc. of Principles of programming languages (POPL 2005), pp. 122\u2013131. ACM Press, New York (2005)"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/225058.225162","volume-title":"Proc. of ACM Symposium on Theory of Computing (STOC 1995)","author":"T.A. Henzinger","year":"1995","unstructured":"Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What\u2019s decidable about hybrid automata? In: Proc. of ACM Symposium on Theory of Computing (STOC 1995), pp. 373\u2013382. ACM Press, New York (1995)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/3-540-55719-9_103","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"1992","unstructured":"Henzinger, T.A., Manna, Z., Pnueli, A.: What good are digital clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 545\u2013558. Springer, Heidelberg (1992)"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Kr\u010d\u00e1l, P., Pel\u00e1nek, R.: Reachability relations and sampled semantics of timed systems. Technical Report FIMU-RS-2005-09, Masaryk University Brno (2005)","DOI":"10.1007\/11590156_25"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1006\/inco.1997.2623","volume":"134","author":"K.G. Larsen","year":"1997","unstructured":"Larsen, K.G., Yi, W.: Time-abstracted bisimulation: Implicit specifications and decidability. Information and Computation\u00a0134(2), 75\u2013101 (1997)","journal-title":"Information and Computation"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/LICS.2003.1210059","volume-title":"Proc. of IEEE Symp. on Logic in Computer Science (LICS 2003)","author":"J. Ouaknine","year":"2003","unstructured":"Ouaknine, J., Worrell, J.: Revisiting digitization, robustness, and decidability for timed automata. In: Proc. of IEEE Symp. on Logic in Computer Science (LICS 2003), pp. 198\u2013207. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11513988_7","volume-title":"Computer Aided Verification","author":"C. Pasareanu","year":"2005","unstructured":"Pasareanu, C., Pel\u00e1nek, R., Visser, W.: Concrete search with abstract matching and refinement. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 52\u201366. Springer, Heidelberg (2005) (to appear)"},{"issue":"1-2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1008387132377","volume":"10","author":"A. Puri","year":"2000","unstructured":"Puri, A.: Dynamical properties of timed automata. Discrete Event Dynamic Systems\u00a010(1-2), 87\u2013113 (2000)","journal-title":"Discrete Event Dynamic Systems"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"CONCUR \u201995 Concurrency Theory","author":"C. Stirling","year":"1995","unstructured":"Stirling, C.: Local model checking games. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 1\u201311. Springer, Heidelberg (1995)"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-24743-2_20","volume-title":"Hybrid Systems: Computation and Control","author":"M. Wulf De","year":"2004","unstructured":"De Wulf, M., Doyen, L., Raskin, J.-F.: Almost ASAP semantics: From timed models to timed implementations. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.\u00a02993, pp. 296\u2013310. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:09Z","timestamp":1619506149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11590156_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}