{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:17:37Z","timestamp":1755217057023,"version":"3.43.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Formal Methods in System Design"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1023\/a:1008792918020","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"175-199","source":"Crossref","is-referenced-by-count":4,"title":["Modelling Asynchrony with a Synchronous Model"],"prefix":"10.1007","volume":"15","author":[{"given":"R.P.","family":"Kurshan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Merritt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Orda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.R.","family":"Sachs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"236618_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek, D.S. Greenberg, M. Merritt, and G. Taubenfeld, \u201cComputing with faulty shared memory,\u201d in Proc. 11th ACM Symp. on Principles of Distributed Computing, 1992.","DOI":"10.1145\/135419.135431"},{"key":"236618_CR2","unstructured":"S. Aggarwal, R.P. Kurshan, and K. Sabnani, \u201cA calculus for protocol specification and validation,\u201d Protocol Specification, Testing and Verification III, North-Holland, pp. 19\u201334, 1983."},{"key":"236618_CR3","doi-asserted-by":"crossref","unstructured":"P. Halmos, Lectures on Boolean Algebras, Springer-Verlag, 1974.","DOI":"10.1007\/978-1-4612-9855-7"},{"key":"236618_CR4","unstructured":"Z. Har'El and R.P. Kurshan, \u201cModelling concurrent processes,\u201d in Proceedings of Internat. Conf. Syst. Sci. Eng., pp. 382\u2013385, 1988."},{"key":"236618_CR5","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare, Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"236618_CR6","unstructured":"R.P. Kurshan, Automata-Theoretic Verification, UC Berkeley Lecture Notes, 1992."},{"key":"236618_CR7","doi-asserted-by":"crossref","unstructured":"R.P. Kurshan, Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach, Princeton University Press, 1994.","DOI":"10.1515\/9781400864041"},{"key":"236618_CR8","unstructured":"N. Lynch, Distributed Algorithms, Morgan-Kaufman, 1996."},{"key":"236618_CR9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner, \u201cCalculi for Synchrony and Asynchrony,\u201d in Theoretical Computer Science, vol. 25, pp. 267\u2013340, 1983.","journal-title":"Theoretical Computer Science"},{"key":"236618_CR10","doi-asserted-by":"crossref","unstructured":"N. Lynch and M. Tuttle, \u201cHierarchical correctness proofs for distributed algorithms,\u201d in Proc. 6th ACM Symp. on Principles of Distributed Computing, pp. 137\u2013151, 1987.","DOI":"10.1145\/41840.41852"},{"key":"236618_CR11","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"N. Lynch and M. Tuttle, \u201cAn introduction to input\/output automata,\u201d CWI-Quarterly, Vol. 2, pp. 219\u2013246, September 1989.","journal-title":"CWI-Quarterly"},{"key":"236618_CR12","doi-asserted-by":"crossref","unstructured":"K.L. McMillan, Symbolic Model Checking, Kluwer, 1993.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"236618_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/A:1008667631119","volume":"10","author":"M. Merritt","year":"1997","unstructured":"M. Merritt, A. Orda, and S.R. Sachs, \u201cFormal verification of a distributed algorithm for accessing faulty shared memory,\u201d Formal Methods in System Design, Vol. 10, pp. 93\u2013125, February 1997.","journal-title":"Formal Methods in System Design"},{"key":"236618_CR14","doi-asserted-by":"crossref","unstructured":"E. Sikorski, Boolean Algebras, Springer Verlag, 1969.","DOI":"10.1007\/978-3-642-85820-8"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008792918020.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008792918020\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008792918020.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T04:36:45Z","timestamp":1754368605000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008792918020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["236618"],"URL":"https:\/\/doi.org\/10.1023\/a:1008792918020","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}