{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:51Z","timestamp":1725456351674},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029958","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"149-158","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Accepting Zeno words without making time stand still"],"prefix":"10.1007","author":[{"given":"B\u00e9atrice","family":"B\u00e9rard","sequence":"first","affiliation":[]},{"given":"Claudine","family":"Picaronny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur and D.L. Dill. Automata for modeling real-time systems. In Proceedings of ICALP'90, number 443 in Lecture Notes in Computer Science, pages 322\u2013335. Springer Verlag, 1990.","DOI":"10.1007\/BFb0032042"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","unstructured":"N. Bedon. Automata, semi-groups and recognizability of words on ordinals. International Journal of Algebra and Computation. to appear."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0304-3975(95)00006-2","volume":"156","author":"N. Bedon","year":"1996","unstructured":"N. Bedon. Finite automata and ordinals. Theoretical Computer Science, 156:119\u2013144, 1996.","journal-title":"Theoretical Computer Science"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0020-0190(95)00077-P","volume":"55","author":"B. B\u00e9rard","year":"1995","unstructured":"B. B\u00e9rard. Untiming timed languages. Information Processing Letters, 55:129\u2013135, 1995.","journal-title":"Information Processing Letters"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"B. B\u00e9rard, P. Gastin, and A. Petit. On the power of non observable actions in timed automata. In Proceedings of STACS'96, number 1046 in Lecture Notes in Computer Science, pages 257\u2013268. Springer Verlag, 1996.","DOI":"10.1007\/3-540-60922-9_22"},{"key":"15_CR7","unstructured":"B. B\u00e9rard, P. Gastin, and A. Petit. Refinement and abstraction for timed languages. Technical report, LSV, CNRS URA 2236, ENS de Cachan, 1997."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"B. B\u00e9rard and C. Picaronny. Accepting zeno words without stopping time. Technical report, LSV, CNRS URA 2236, ENS de Cachan, 1997.","DOI":"10.1007\/BFb0029958"},{"key":"15_CR9","unstructured":"R. B\u00fcchi. On a decision method in restricted second order arithmetic. In Proceedings of the International Congress on Logic, Methodology and Philosophy, pages 1\u201311. Standford University Press, 1962."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0022-0000(78)90036-3","volume":"17","author":"Y. Choueka","year":"1978","unstructured":"Y. Choueka. Finite automata, definable sets and regular expressions over \u03c9n-tapes. Journal of Computer and System Sciences, 17:81\u201397, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In Proceedings of CAV'91, number 575 in Lecture Notes in Computer Science, pages 399\u2013409. Springer Verlag, 1991.","DOI":"10.1007\/3-540-55179-4_37"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"V. Diekert, P. Gastin, and A. Petit. Removing \u025b-transitions in timed automata. In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS'97), number 1200 in Lecture Notes in Computer Science, pages 583\u2013594. Springer Verlag, 1997.","DOI":"10.1007\/BFb0023491"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(94)00145-9","volume":"138","author":"M.R. Hansen","year":"1995","unstructured":"M.R. Hansen, P.K. Pandya, and C. Zhou. Finite divergence. Theoretical Computer Science, 138:113\u2013139, 1995.","journal-title":"Theoretical Computer Science"},{"key":"15_CR14","unstructured":"J. C. Hemmer and P. Wolper. Ordinal finite automata and languages. Technical report, University of Liege, 1992."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, Z. Manna, and A. Pnueli. Temporal proofs methodologies for real-time systems. In Proceedings of POPL'91, pages 353\u2013366, 1991.","DOI":"10.1145\/99583.99629"},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T.A. Henzinger","year":"1994","unstructured":"T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193\u2013244, 1994.","journal-title":"Information and Computation"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"N. Lynch and H. Attiya. Using mappings to prove timing properties. In Proceedings of PODC'90, pages 265\u2013280, 1990.","DOI":"10.1145\/93385.93428"},{"key":"15_CR18","unstructured":"J. Ostroff. Temporal Logic of Real-time Systems. Research Studies Press, 1990."},{"key":"15_CR19","unstructured":"C. Ramchandani. Analysis of asynchronous concurrent systems by Petri nets. Technical report, Massachusetts Institute of Technology, 1974."},{"key":"15_CR20","volume-title":"Linear orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"J.G. Rosenstein. Linear orderings. Academic Press, New York, 1982."},{"key":"15_CR21","doi-asserted-by":"crossref","first-page":"379","DOI":"10.3233\/FI-1985-83-407","volume":"8.3-4","author":"J. Wojciechowski","year":"1985","unstructured":"J. Wojciechowski. Finite automata on transfinite sequences and regular expressions. Fundamenta Informaticae, 8.3-4:379\u2013396, 1985.","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T20:21:42Z","timestamp":1626812502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0029958","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}