{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:05:28Z","timestamp":1648778728804},"reference-count":15,"publisher":"Elsevier BV","issue":"2-5","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0165-6074(93)90068-v","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:14:48Z","timestamp":1062609288000},"page":"111-114","source":"Crossref","is-referenced-by-count":6,"title":["A quick distributed consensus protocol"],"prefix":"10.1016","volume":"39","author":[{"given":"F.","family":"Guerra","sequence":"first","affiliation":[]},{"given":"S.","family":"Ar\u00e9valo","sequence":"additional","affiliation":[]},{"given":"A.","family":"Alvarez","sequence":"additional","affiliation":[]},{"given":"J.","family":"Miranda","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(93)90068-V_BIB1","series-title":"Replica Consensus in Fault Tolerant Concurrent C","author":"Ar\u00e9valo","year":"1989"},{"issue":"1","key":"10.1016\/0165-6074(93)90068-V_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","article-title":"Introduction to the ISO Specification Language LOTOS","volume":"14","author":"Bolognesi","year":"1988","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/0165-6074(93)90068-V_BIB3","series-title":"Proceedings 14th ACM Symposium on Theory of Computing","article-title":"Polynomial Algorithms for Multiple Processor Agreement","author":"Dolev","year":"1982"},{"issue":"N4","key":"10.1016\/0165-6074(93)90068-V_BIB4","doi-asserted-by":"crossref","DOI":"10.1137\/0212045","article-title":"Authenticated Algorithms for Byzantine Agreement","volume":"V12","author":"Dolev","year":"1983","journal-title":"SIAM J. Computers"},{"key":"10.1016\/0165-6074(93)90068-V_BIB5","series-title":"IEEE Sixth Symposium on Reliability in Distributed Software and Database Systems","article-title":"Early Stopping Algorithms for Distributed Agreement under Fail-Stop, Omission, and Timing Fault Types","author":"Ezhilchelvan","year":"1987"},{"key":"10.1016\/0165-6074(93)90068-V_BIB6","series-title":"Byzantine Agreement Under Restricted Types of Failures","author":"Hadzilacos","year":"1984"},{"key":"10.1016\/0165-6074(93)90068-V_BIB7","article-title":"Information Processing Systems \u2014 Open Systems Interconnection \u2014 LOTOS \u2014 A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour","author":"ISO","year":"1989"},{"issue":"N3","key":"10.1016\/0165-6074(93)90068-V_BIB8","doi-asserted-by":"crossref","DOI":"10.1145\/357172.357176","article-title":"The Byzantine Generals Problem","volume":"V4","author":"Lamport","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0165-6074(93)90068-V_BIB9","article-title":"Byzantine Generals and Transaction Commit Protocols","author":"Lamport","year":"1984"},{"key":"10.1016\/0165-6074(93)90068-V_BIB10","series-title":"Second Symposium on Reliability in Distributed Software and Database Systems","article-title":"A Simple and Efficient Byzantine Generals Algorithm","author":"Lynch","year":"1982"},{"key":"10.1016\/0165-6074(93)90068-V_BIB11","article-title":"Tool Support to Implement LOTOS Formal Specifications","author":"Ma\u00f1as","year":"1992","journal-title":"Computer Networks and ISDN Systems"},{"issue":"N2","key":"10.1016\/0165-6074(93)90068-V_BIB12","doi-asserted-by":"crossref","DOI":"10.1145\/322186.322188","article-title":"Reaching Agreement in the Presence of Faults","volume":"V27","author":"Pease","year":"1980","journal-title":"JACM"},{"issue":"N6","key":"10.1016\/0165-6074(93)90068-V_BIB13","doi-asserted-by":"crossref","DOI":"10.1109\/2.153253","article-title":"The Many Faces of Consensus in Distributed Systems","volume":"V25","author":"Turek","year":"1992","journal-title":"IEEE Computer"},{"key":"10.1016\/0165-6074(93)90068-V_BIB14","article-title":"Extending Binary Agreement to Multivalued Byzantine Agreement","volume":"V18","author":"Turpin","year":"1984","journal-title":"Information Processing Letters"},{"issue":"N3","key":"10.1016\/0165-6074(93)90068-V_BIB15","doi-asserted-by":"crossref","DOI":"10.1145\/357369.357371","article-title":"Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems","volume":"V1","author":"Schlichting","year":"1983","journal-title":"ACM Transactions on Computing Systems"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749390068V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749390068V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T09:51:03Z","timestamp":1585129863000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016560749390068V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":15,"journal-issue":{"issue":"2-5","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["016560749390068V"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(93)90068-v","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}