{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:29:13Z","timestamp":1784644153965,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540253884","type":"print"},{"value":"9783540319825","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31982-5_14","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:29:02Z","timestamp":1294990142000},"page":"219-233","source":"Crossref","is-referenced-by-count":49,"title":["Fault Diagnosis Using Timed Automata"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabrice","family":"Chevalier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deepak","family":"D\u2019Souza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"14_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.: A theory of timed automata. Theoretical Computer Science (TCS)\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science (TCS)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-58179-0_39","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1994","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: A determinizable class of timed automata. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 1\u201313. Springer, Heidelberg (1994)"},{"issue":"2\u20133","key":"14_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-36233","volume":"36","author":"B. B\u00e9rard","year":"1998","unstructured":"B\u00e9rard, B., Diekert, V., Gastin, P., Petit, A.: Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae\u00a036(2\u20133), 145\u2013182 (1998)","journal-title":"Fundamenta Informaticae"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-45069-6_18","volume-title":"Computer Aided Verification","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P., D\u2019Souza, D., Madhusudan, P., Petit, A.: Timed control with partial observability. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 180\u2013192. Springer, Heidelberg (2003)"},{"key":"14_CR5","unstructured":"Chevalier, F.: D\u00e9tection d\u2019erreurs dans les syst\u00e8mes temporis\u00e9s. Master\u2019s thesis, DEA Algorithmique, Paris (2004)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/3-540-45841-7_47","volume-title":"STACS 2002","author":"D. D\u2019Souza","year":"2002","unstructured":"D\u2019Souza, D., Madhusudan, P.: Timed control synthesis for external specifications. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 571\u2013582. Springer, Heidelberg (2002)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-30206-3_7","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"D. D\u2019Souza","year":"2004","unstructured":"D\u2019Souza, D., Tabareau, N.: On timed automata with input-determined guards. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 68\u201383. Springer, Heidelberg (2004)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-30206-3_26","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"O. Grinchtein","year":"2004","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 379\u2013395. Springer, Heidelberg (2004)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"14_CR10","series-title":"Electronic Notes in Computer Science","volume-title":"Proc. 3rd Int. Work. Runtime Verification","author":"K.J. Kristoffersen","year":"2003","unstructured":"Kristoffersen, K.J., Pedersen, C., Andersen, H.R.: Runtime verification of timed LTL using disjunctive normalized equation systems. In: Proc. 3rd Int. Work. Runtime Verification. Electronic Notes in Computer Science. Elsevier, Amsterdam (2003)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-30206-3_11","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"M. Krichen","year":"2004","unstructured":"Krichen, M., Tripakis, S.: Real-time testing with timed automata testers and coverage criteria. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 134\u2013151. Springer, Heidelberg (2004)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-60246-1_158","volume-title":"Mathematical Foundations of Computer Science 1995","author":"F. Laroussinie","year":"1995","unstructured":"Laroussinie, F., Larsen, K.G., Weise, C.: From timed automata to logic \u2013 and back. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 529\u2013539. Springer, Heidelberg (1995)"},{"key":"14_CR13","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"9","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1109\/9.412626","volume":"40","author":"M. Sampath","year":"1995","unstructured":"Sampath, M., Sengupta, R., Lafortune, S., Sinnamohideen, K., Teneketzis, D.C.: Diagnosability of discrete event systems. IEEE Transactions on Automatic Control\u00a040(9), 1555\u20131575 (1995)","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/87.486338","volume":"4","author":"M. Sampath","year":"1996","unstructured":"Sampath, M., Sengupta, R., Lafortune, S., Sinnamohideen, K., Teneketzis, D.C.: Failure diagnosis using discrete event systems. IEEE Transactions on Control Systems Technology\u00a04(2), 105\u2013124 (1996)","journal-title":"IEEE Transactions on Control Systems Technology"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-45739-9_14","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"S. Tripakis","year":"2002","unstructured":"Tripakis, S.: Fault diagnosis for timed automata. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol.\u00a02469, pp. 205\u2013224. Springer, Heidelberg (2002)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-40903-8_15","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"S. Tripakis","year":"2004","unstructured":"Tripakis, S.: Folk theorems on the determinization and minimization of timed automata. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol.\u00a02791, pp. 182\u2013188. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31982-5_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:32:51Z","timestamp":1605760371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31982-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253884","9783540319825"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31982-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}