{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:35:44Z","timestamp":1754483744366},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600459"},{"type":"electronic","value":"9783540494133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60045-0_61","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:36:55Z","timestamp":1330259815000},"page":"339-352","source":"Crossref","is-referenced-by-count":6,"title":["Modelling asynchrony with a synchronous model"],"prefix":"10.1007","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","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek, D. S. Greenberg, M. Merritt, and G. Taubenfeld. Computing with Faulty Shared Memory. In Proc. 11th ACM Symp. on Principles of Distributed Computing, 1992.","DOI":"10.1145\/135419.135431"},{"key":"27_CR2","unstructured":"S. Aggarwal, R. P. Kurshan, and K. Sabnani. A Calculus for Protocol Specification and Validation. In Protocol Specification, Testing and Verification III, pages 19\u201334. North-Holland, 1983."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"P. Halmos. Lectures on Boolean Algebras. Springer-Verlag, 1974.","DOI":"10.1007\/978-1-4612-9855-7"},{"key":"27_CR4","unstructured":"Z. Har'El and R. P. Kurshan. Modelling concurrent processes. In Proceedings of Internat. Conf. Syst. Sci. Eng., pages 382\u2013385, 1988."},{"key":"27_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":"27_CR6","unstructured":"R. P. Kurshan. Automata-Theoretic Verification. UC Berkeley Lecture Notes, 1992."},{"key":"27_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":"27_CR8","unstructured":"R. P. Kurshan, M. Merritt, A. Orda, and S. R. Sachs. Formal Verification of a Distributed Algorithm for Accessing Faulty Shared Memory. In Proc. of SBT\/IEEE International Telecom. Symp., Rio de Janeiro, Brazil, 1994."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"N. Lynch and M. Tuttle. Hierarchical Correctness Proofs for Distributed Algorithms. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 137\u2013151, 1987.","DOI":"10.1145\/41840.41852"},{"issue":"3","key":"27_CR10","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"N. Lynch and M. Tuttle. An Introduction to Input\/Output Automata. CWI-Quarterly, 2(3):219\u2013246, September 1989.","journal-title":"CWI-Quarterly"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"K. L. McMillan. Symbolic Model Checking. Kluwer, 1993.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"27_CR12","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. Calculi for Synchrony and Asynchrony. Theoretical Computer Sci., 25:267\u2013340, (1983).","journal-title":"Theoretical Computer Sci."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"E. Sikorski. Boolean Algebras. Springer Verlag, 1969.","DOI":"10.1007\/978-3-642-85820-8"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60045-0_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:22:22Z","timestamp":1640924542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60045-0_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600459","9783540494133"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60045-0_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}