{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:38Z","timestamp":1725663578306},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569220"},{"type":"electronic","value":"9783540477877"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56922-7_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:54:59Z","timestamp":1330257299000},"page":"491-504","source":"Crossref","is-referenced-by-count":1,"title":["A Structural linearization principle for processes"],"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,27]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"R. P. Kurshan and K. McMillan, \u201cA structural induction theorem for processes,\u201d in Proceedings of 8th ACM Symp. on Principles of Distributed Computing, pp. 239\u2013247, 1989.","DOI":"10.1145\/72981.72998"},{"key":"40_CR2","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":"40_CR3","unstructured":"M. C. Browne, E. M. Clarke, and O. Grumberg, \u201cReasoning about networks with many identical finite state processes,\u201d in In ACM Symp. Principles of Distributed Computing 5, 1986."},{"key":"40_CR4","volume-title":"Reasoning about systems with many processes","author":"S. M. German","year":"1988","unstructured":"S. M. German and A. P. Sistla, \u201cReasoning about systems with many processes,\u201d GTE Laboratories Inc., Waltham, Massachusetts, 1988."},{"key":"40_CR5","first-page":"151","volume":"407","author":"Z. Shtadler","year":"1989","unstructured":"Z. Shtadler and O. Grumberg, \u201cNetwork grammars, communication behaviors and automatic verification,\u201d LNCS, vol. 407, pp. 151\u2013165, 1989.","journal-title":"LNCS"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Y. Afek, D. S. Greenberg, M. Merritt, and G. Taubenfeld, \u201cComputing with faulty shared memory,\u201d in Proceedings of 11th ACM Symp. on Principles of Distributed Computing, 1992.","DOI":"10.1145\/135419.135431"},{"key":"40_CR7","unstructured":"R. P. Kurshan, M. Merritt, A. Orda, and S. R. Sachs, \u201cFormal verification of a distributed algorithm for accessing faulty shared memory,\u201d (in preparation), 1993."},{"key":"40_CR8","first-page":"414","volume":"430","author":"R. P. Kurshan","year":"1990","unstructured":"R. P. Kurshan, \u201cAnalysis of discrete event coordination,\u201d LNCS, vol. 430, pp. 414\u2013453, 1990.","journal-title":"LNCS"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"D. Dill, Trace Theory for Automatic Hierarchical Verification. MIT Press, 1989.","DOI":"10.7551\/mitpress\/6874.001.0001"},{"key":"40_CR10","unstructured":"M. Hennessy, Algebraic Tehory of Processes. MIT Press, 1988."},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner, A Calculus for Communicating Systems (volume 92 of LNCS). Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"N. Lynch and M. Tuttle, \u201cHierarchical correctness proofs for distributed algorithms,\u201d in Proceedings of 6th ACM Symp. on Principles of Distributed Computing, pp. 137\u2013151, 1987.","DOI":"10.1145\/41840.41852"},{"key":"40_CR13","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":"40_CR14","unstructured":"R. P. Kurshan, Automata-Theoretic Verification of Coordinating Processes. UC Berkeley Lecture Notes, 1992."},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"R. P. Kurshan and L. Lamport, \u201cVerification of a multiplier: 64 bits and beyond,\u201d preprint, 1993.","DOI":"10.1007\/3-540-56922-7_14"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56922-7_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:08:08Z","timestamp":1640927288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56922-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569220","9783540477877"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-56922-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}