{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T17:52:42Z","timestamp":1676569962600},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T00:00:00Z","timestamp":1392249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s00446-014-0209-4","type":"journal-article","created":{"date-parts":[[2014,2,12]],"date-time":"2014-02-12T06:53:07Z","timestamp":1392187987000},"page":"287-311","source":"Crossref","is-referenced-by-count":2,"title":["Fault tolerance in distributed systems using fused state machines"],"prefix":"10.1007","volume":"27","author":[{"given":"Bharath","family":"Balasubramanian","sequence":"first","affiliation":[]},{"given":"Vijay K.","family":"Garg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,13]]},"reference":[{"issue":"1","key":"209_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"key":"209_CR2","doi-asserted-by":"crossref","unstructured":"Balasubramanian, B., Garg, V.K.: Fused data structures for handling multiple faults in distributed systems. In: Proceedings of the 2011 31st International Conference on Distributed Computing Systems, ICDCS \u201911, pp. 677\u2013688, IEEE Computer Society, Washington, DC, USA (2011)","DOI":"10.1109\/ICDCS.2011.80"},{"key":"209_CR3","unstructured":"Balasubramanian, B., Garg, V.K.: Fused fsm design tool (implemented in java 1.6). In: Parallel and Distributed Systems Laboratory, http:\/\/maple.ece.utexas.edu (2011)"},{"key":"209_CR4","doi-asserted-by":"crossref","unstructured":"Balasubramanian, B., Garg, V.K.: Fused state machines for fault tolerance in distributed systems. In: Principles of Distributed Systems\u201415th International Conference, OPODIS 2011, Toulouse, France, December 13\u201316, 2011. Proceedings, volume 7109 of Lecture Notes in Computer Science, pp. 266\u2013282. Springer (2011)","DOI":"10.1007\/978-3-642-25873-2_19"},{"key":"209_CR5","doi-asserted-by":"crossref","unstructured":"Balasubramanian, B., Ogale, V., Garg, V.K.: Fault tolerance in finite state machines using fusion. In: Proceedings of International Conference on Distributed Computing and Networking (ICDCN) 2008, Kolkata, volume 4904 of Lecture Notes in Computer Science, pp. 124\u2013134. Springer (2008)","DOI":"10.1007\/978-3-540-77444-0_10"},{"key":"209_CR6","unstructured":"Balasubramanian, B., Ogale, V., Garg, V.K.: Fusion generator (implemented in java 1.6). In: Parallel and Distributed Systems Laboratory, http:\/\/maple.ece.utexas.edu (2007)"},{"key":"209_CR7","doi-asserted-by":"crossref","unstructured":"Balazinska, M., Balakrishnan, H., Madden, S., Stonebraker, M.: Fault-Tolerance in the Borealis Distributed Stream Processing System. In: ACM SIGMOD Conference, Baltimore, MD (June 2005)","DOI":"10.1145\/1066157.1066160"},{"key":"209_CR8","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)"},{"key":"209_CR9","unstructured":"Clement, A., Marchetti, M., Wong, E., Alvisi, L., Dahlin, M.: Making Byzantine fault tolerant systems tolerate Byzantine faults. In: 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI) (April 2009)"},{"issue":"3","key":"209_CR10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01784024","volume":"3","author":"F Cristian","year":"1989","unstructured":"Cristian, F.: Probabilistic clock synchronization. Distrib. Comput. 3(3), 146\u2013158 (1989)","journal-title":"Distrib. Comput."},{"key":"209_CR11","doi-asserted-by":"crossref","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM 51, 107\u2013113 (January 2008)","DOI":"10.1145\/1327452.1327492"},{"issue":"4","key":"209_CR12","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/1041680.1041682","volume":"36","author":"X D\u00e9fago","year":"2004","unstructured":"D\u00e9fago, X., Schiper, A., Urb\u00e1n, P.: Total order broadcast and multicast algorithms: taxonomy and survey. ACM Comput. Surv. 36(4), 372\u2013421 (2004)","journal-title":"ACM Comput. Surv."},{"key":"209_CR13","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2) (April 1985)","DOI":"10.1145\/3149.214121"},{"key":"209_CR14","unstructured":"Garg, V.K., Ogale, V.: Fusible data structures for fault tolerance. In: ICDCS 2007: Proceedings of the 27th International Conference on Distributed, Computing Systems (June 2007)"},{"key":"209_CR15","doi-asserted-by":"crossref","unstructured":"Garg, V.K.: Implementing fault-tolerant services using state machines: beyond replication. In: Proceedings of the 24th International Conference on Distributed Computing, DISC\u201910, pp. 450\u2013464, Springer, Berlin (2010 )","DOI":"10.1007\/978-3-642-15763-9_44"},{"key":"209_CR16","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB \u201999: Proceedings of the 25th International Conference on Very Large Data Bases, pp. 518\u2013529, Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"issue":"2","key":"209_CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R Hamming","year":"1950","unstructured":"Hamming, R.: Error-detecting and error-correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Tech. J."},{"key":"209_CR18","volume-title":"Algebraic Structure Theory of Sequential Machines (Prentice-Hall international series in applied mathematics)","author":"J Hartmanis","year":"1966","unstructured":"Hartmanis, J., Stearns, R.E.: Algebraic Structure Theory of Sequential Machines (Prentice-Hall international series in applied mathematics). Prentice-Hall Inc, Upper Saddle River (1966)"},{"key":"209_CR19","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Technical report, Stanford, CA, USA (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"209_CR20","doi-asserted-by":"crossref","unstructured":"Huffman, DA.: The synthesis of sequential switching circuits. Technical report, Massachusetts, USA (1954)","DOI":"10.1016\/0016-0032(54)90618-3"},{"key":"209_CR21","unstructured":"Kasten, O., R\u00f6mer, K.: Beyond event handlers: programming wireless sensors with attributed state machines. In: Proceedings of the 4th International Symposium on Information Processing in Sensor Networks, IPSN \u201905, IEEE Press, Piscataway (2005)"},{"key":"209_CR22","doi-asserted-by":"crossref","unstructured":"Kothari, N., Millstein, T., Govindan, R.: Deriving state machines from tinyos programs using symbolic execution. In: Proceedings of the 7th International Conference on Information Processing in Sensor Networks, IPSN \u201908, pp. 271\u2013282, IEEE Computer Society, Washington (2008)","DOI":"10.1109\/IPSN.2008.62"},{"key":"209_CR23","unstructured":"Lamport, L., Fischer, M.: Byzantine generals and transaction commit protocols. Technical report (1982)"},{"key":"209_CR24","first-page":"95","volume":"2","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: The implementation of reliable distributed multiprocess systems. Comput. Netw. 2, 95\u2013114 (1978)","journal-title":"Comput. Netw."},{"key":"209_CR25","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"209_CR26","doi-asserted-by":"crossref","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","DOI":"10.1145\/359545.359563"},{"key":"209_CR27","doi-asserted-by":"crossref","unstructured":"Lee, S.H., Lee, S., Song, H., Lee, H.S.: Wireless sensor network design for tactical military applications: remote large-scale environments. In: Proceedings of the 28th IEEE Conference on Military Communications, MILCOM\u201909, pp. 911\u2013917, IEEE Press, Piscataway (2009)","DOI":"10.1109\/MILCOM.2009.5379900"},{"issue":"2","key":"209_CR28","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/12.980009","volume":"51","author":"D Lee","year":"2002","unstructured":"Lee, D., Yannakakis, M.: Closed partition lattice and machine decomposition. IEEE Trans. Comput. 51(2), 216\u2013228 (2002)","journal-title":"IEEE Trans. Comput."},{"key":"209_CR29","doi-asserted-by":"crossref","unstructured":"Mainwaring, A., Culler, D., Polastre, J., Szewczyk, R., Anderson, J.: Wireless sensor networks for habitat monitoring. In: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, WSNA \u201902, pp. 88\u201397, ACM, New York (2002)","DOI":"10.1145\/570738.570751"},{"issue":"1","key":"209_CR30","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/71.80121","volume":"1","author":"PM Melliar-Smith","year":"1990","unstructured":"Melliar-Smith, P.M., Moser, L.E., Agrawala, V.: Broadcast protocols for distributed systems. IEEE Trans. Parallel Distrib. Syst. 1(1), 17\u201325 (1990)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"209_CR31","doi-asserted-by":"crossref","unstructured":"Mishchenko, A., Chatterjee, S., Brayton, R.: Dag-aware aig rewriting: a fresh look at combinational logic synthesis. In: DAC 06: Proceedings of the 43rd Annual Conference on Design Automation, pp. 532\u2013536. ACM Press (2006)","DOI":"10.1145\/1146909.1147048"},{"key":"209_CR32","doi-asserted-by":"crossref","unstructured":"Ogale, V., Balasubramanian, B., Garg, V.K.: A fusion-based approach for tolerating faults in finite state machines. In: Proceedings of the 2009 IEEE International Symposium on Parallel & Distributed Processing, IPDPS \u201909, pp. 1\u201311, IEEE Computer Society, Washington (2009)","DOI":"10.1109\/IPDPS.2009.5161018"},{"key":"209_CR33","unstructured":"Peterson, W.W., Weldon, E.J.: Error-Correcting Codes\u2014Revised, 2nd Edition. The MIT Press, Cambridge (March 1972)"},{"issue":"10","key":"209_CR34","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/2.58235","volume":"23","author":"P Ramanathan","year":"1990","unstructured":"Ramanathan, P., Shin, K.G., Butler, R.W.: Fault-tolerant clock synchronization in distributed systems. Computer 23(10), 33\u201342 (1990)","journal-title":"Computer"},{"issue":"2","key":"209_CR35","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/190.357399","volume":"2","author":"FB Schneider","year":"1984","unstructured":"Schneider, F.B.: Byzantine generals in action: implementing fail-stop processors. ACM Trans. Comput. Syst. 2(2), 145\u2013154 (1984)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"4","key":"209_CR36","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"FB Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22(4), 299\u2013319 (1990)","journal-title":"ACM Comput. Surv."},{"key":"209_CR37","doi-asserted-by":"crossref","unstructured":"Shah, M.A., Hellerstein, J.M., Brewer, E: Highly available, fault-tolerant, parallel dataflows. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201904, pp. 827\u2013838, ACM, New York (2004)","DOI":"10.1145\/1007568.1007662"},{"key":"209_CR38","unstructured":"Tenzakhti, F., Day, K., Ould-Khaoua, M.: Replication algorithms for the world-wide web. J. Syst. Archit. 50(10), 591\u2013605 (2004)"},{"key":"209_CR39","unstructured":"Yang, S.: Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 (1991)"},{"issue":"1","key":"209_CR40","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/(SICI)1520-684X(199801)29:1<53::AID-SCJ6>3.0.CO;2-Q","volume":"29","author":"H Youra","year":"1998","unstructured":"Youra, H., Inoue, T., Masuzawa, T., Fujiwara, H.: On the synthesis of synchronizable finite state machines with partial scan. Syst. Comput. Jpn. 29(1), 53\u201362 (1998)","journal-title":"Syst. Comput. Jpn."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0209-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0209-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0209-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:58:56Z","timestamp":1565189936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0209-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,13]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["209"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0209-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,13]]}}}