{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:43:17Z","timestamp":1725576197713},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540231677"},{"type":"electronic","value":"9783540302063"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30206-3_7","type":"book-chapter","created":{"date-parts":[[2011,1,18]],"date-time":"2011-01-18T05:19:15Z","timestamp":1295327955000},"page":"68-83","source":"Crossref","is-referenced-by-count":24,"title":["On Timed Automata with Input-Determined Guards"],"prefix":"10.1007","author":[{"given":"Deepak","family":"D\u2019Souza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Tabareau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_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, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM\u00a043, 116\u2013146 (1996)","journal-title":"J. ACM"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1994","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: a determinizable class of timed automata. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 1\u201313. Springer, Heidelberg (1994)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1993.1025","volume":"104","author":"R. Alur","year":"1993","unstructured":"Alur, R., Henzinger, T.A.: Real-time logics: complexity and expressiveness. Information and Computation\u00a0104, 35\u201377 (1993)","journal-title":"Information and Computation"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata, Zeitschrift f\u00fcr Math. Logik und Grundlagen der Mathematik\u00a06, 66\u201392 (1960)","journal-title":"Logik und Grundlagen der Mathematik"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"D\u2019Souza, D.: A Logical Characterisation of Event Clock Automata. J. Foundations of Computer Science 14(4), World Scientific (2003)","DOI":"10.1142\/S0129054103001923"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"D\u2019Souza, D., Tabareau, N.: On timed automata with input-determined guards, Technical report TR-2004-1, CSA\/IISc, \n                    \n                      http:\/\/archive.csa.iisc.ernet.in\/TR","DOI":"10.1007\/978-3-540-30206-3_7"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Computing in Object-Oriented Parallel Environments","author":"D. D\u2019Souza","year":"1999","unstructured":"D\u2019Souza, D., Thiagarajan, P.S.: Product Interval Automata: A Subclass of Timed Automata. In: Matsuoka, S., Tholburn, M. (eds.) ISCOPE 1999. LNCS, vol.\u00a01732, Springer, Heidelberg (1999)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: The Temporal Analysis of Fairness. In: Seventh ACM Symposium on Principles of Programming Languages, pp. 163\u2013173 (1980)","DOI":"10.1145\/567446.567462"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BFb0055086","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 580\u2013591. Springer, Heidelberg (1998)"},{"key":"7_CR11","unstructured":"Kamp, H.: Tense Logic and the Theory of Linear Order, PhD Thesis, University of California (1968)"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R. Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with metric temporal logic. Real-time Systems\u00a02(4), 255\u2013299 (1990)","journal-title":"Real-time Systems"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. 18th IEEE FOCS, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"7_CR14","unstructured":"Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real Time, Ph.D Thesis, FUNDP, Belgium (1999)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BFb0014711","volume-title":"Hybrid and Real-Time Systems","author":"J.-F. Raskin","year":"1997","unstructured":"Raskin, J.-F., Schobbens, P.-Y.: State-clock Logic: A Decidable Real-Time Logic. In: Maler, O. (ed.) HART 1997. LNCS, vol.\u00a01201, pp. 33\u201347. Springer, Heidelberg (1997)"},{"key":"7_CR16","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on Infinite Objects. In: Leeuwen, J.V. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier, Amsterdam (1990)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"T. Wilke","year":"1994","unstructured":"Wilke, T.: Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol.\u00a0863, pp. 694\u2013715. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30206-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:48:36Z","timestamp":1558295316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30206-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540231677","9783540302063"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30206-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}