{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:27:30Z","timestamp":1737178050890,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540490180"},{"type":"electronic","value":"9783540498230"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/978-3-540-49823-0_9","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T12:12:32Z","timestamp":1182859952000},"page":"122-136","source":"Crossref","is-referenced-by-count":9,"title":["Incremental Synthesis of Fault-Tolerant Real-Time Programs"],"prefix":"10.1007","author":[{"given":"Borzoo","family":"Bonakdarpour","sequence":"first","affiliation":[]},{"given":"Sandeep S.","family":"Kulkarni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"10","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1109\/12.729793","volume":"47","author":"M. Pandya","year":"1998","unstructured":"Pandya, M., Malek, M.: Minimum achievable utilization for fault-tolerant processing of periodic tasks. IEEE Transations on Computers\u00a047(10), 1102\u20131112 (1998)","journal-title":"IEEE Transations on Computers"},{"issue":"8","key":"9_CR2","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1109\/TSE.2003.1223648","volume":"29","author":"D. Moss\u00e9","year":"2003","unstructured":"Moss\u00e9, D., Melhem, R.G., Ghosh, S.: A nonpreemptive real-time scheduler with recovery from transient faults and its implementation. IEEE Transactions on Software Engineering\u00a029(8), 752\u2013767 (2003)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-70952-7_17","volume-title":"Formal Methods: Applications and Technology","author":"B. Bonakdarpour","year":"2007","unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Automated incremental synthesis of timed automata. In: Brim, L., Haverkort, B.R., Leucker, M., van de Pol, J. (eds.) FMICS 2006 and PDMC 2006. LNCS, vol.\u00a04346, pp. 261\u2013276. Springer, Heidelberg (2007)"},{"key":"9_CR4","volume-title":"Parallel Program Design: A Foundation","author":"K.M. Chandy","year":"1988","unstructured":"Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading (1988)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/11795490_22","volume-title":"Principles of Distributed Systems","author":"A. Ebnenasir","year":"2006","unstructured":"Ebnenasir, A., Kulkarni, S.S., Bonakdarpour, B.: Revising UNITY programs: Possibilities and limitations. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 275\u2013290. Springer, Heidelberg (2006)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Kulkarni, S.S., Arora, A.: Automating the addition of fault-tolerance. In: Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT), pp. 82\u201393 (2000)","DOI":"10.1007\/3-540-45352-0_9"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Kulkarni, S.S., Arora, A., Chippada, A.: Polynomial time synthesis of Byzantine agreement. In: 20th Symposium on Reliable Distributed Systems (SRDS), pp. 130\u2013140 (2001)","DOI":"10.1109\/RELDIS.2001.969767"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Kulkarni, S.S., Ebnenasir, A.: Automated synthesis of multitolerance. In: International Conference on Dependable Systems and Networks (DSN), pp. 209\u2013219 (2004)","DOI":"10.1109\/DSN.2004.1311891"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1145\/963778.963782","volume":"26","author":"P.C. Attie","year":"2004","unstructured":"Attie, P.C., Arora, A., Emerson, E.A.: Synthesis of fault-tolerant concurrent programs. ACM Transactions on Programming Languages and Systems\u00a026(1), 125\u2013185 (2004)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR10","unstructured":"Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: IFAC Symposium on System Structure and Control, pp. 469\u2013474 (1998)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48983-5_6","volume-title":"Hybrid Systems: Computation and Control","author":"E. Asarin","year":"1999","unstructured":"Asarin, E., Maler, O.: As soon as possible: Time optimal control for timed automata. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol.\u00a01569, pp. 19\u201330. Springer, Heidelberg (1999)"},{"key":"9_CR12","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":"9_CR13","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":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-45187-7_9","volume-title":"CONCUR 2003 - Concurrency Theory","author":"L. Alfaro de","year":"2003","unstructured":"de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: The element of surprise in timed games. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 144\u2013158. Springer, Heidelberg (2003)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Faella, M., LaTorre, S., Murano, A.: Dense real-time games. In: Logic in Computer Science (LICS), pp. 167\u2013176 (2002)","DOI":"10.1109\/LICS.2002.1029826"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R. Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time. Information and Computation\u00a0104(1), 2\u201334 (1993)","journal-title":"Information and Computation"},{"issue":"2","key":"9_CR17","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\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"9_CR18","unstructured":"Abdedda\u00efm, Y.: Scheduling with Timed Automata. PhD thesis, INPG, Grenoble (November 2002)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Automatic addition of fault-tolerance to real-time programs. Technical Report MSU-CSE-06-13, Department of Computer Science and Engineering, Michigan State University (2006)","DOI":"10.21236\/ADA455712"},{"issue":"1-2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s100090050007","volume":"1","author":"R. Alur","year":"1997","unstructured":"Alur, R., Henzinger, T.A.: Real-time system = discrete system + clock variables. International Journal on Software Tools for Technology Transfer\u00a01(1-2), 86\u2013109 (1997)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(92)90005-G","volume":"43","author":"T.A. Henzinger","year":"1992","unstructured":"Henzinger, T.A.: Sooner is safer than later. Information Processing Letters\u00a043(3), 135\u2013141 (1992)","journal-title":"Information Processing Letters"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. Information Processing Letters\u00a021, 181\u2013185 (1985)","journal-title":"Information Processing Letters"},{"issue":"11","key":"9_CR23","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1109\/32.256850","volume":"19","author":"A. Arora","year":"1993","unstructured":"Arora, A., Gouda, M.G.: Closure and convergence: A foundation of fault-tolerant computing. IEEE Transactions on Software Engineering\u00a019(11), 1015\u20131027 (1993)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-55179-4_37","volume-title":"Computer Aided Verification","author":"C. Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 399\u2013409. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49823-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T22:12:33Z","timestamp":1737151953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49823-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540490180","9783540498230"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49823-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}