{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:19:33Z","timestamp":1754486373097},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form Method Syst Des"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf01383832","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T00:29:21Z","timestamp":1112401761000},"page":"227-244","source":"Crossref","is-referenced-by-count":9,"title":["A structural linearization principle for processes"],"prefix":"10.1007","volume":"5","author":[{"given":"Robert P.","family":"Kurshan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Merritt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Orda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonia R.","family":"Sachs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek, D. S. Greenberg, M. Merritt, and G. Taubenfeld. Computing with faulty shared memory. InProceedings of 11th ACM Symp. on Principles of Distributed Computing, 1992.","DOI":"10.1145\/135419.135431"},{"key":"CR2","unstructured":"M. C. Browne, E. M. Clarke, and O. Grumberg. Reasoning about networks with many identical finite state processes. InProceedings of 5th ACM Symp. on Principles of Distributed Computing, 1986."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"D. Dill.Trace Theory for Automatic Hierarchical Verification. MIT Press, 1989.","DOI":"10.7551\/mitpress\/6874.001.0001"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"S. M. German","year":"1992","unstructured":"S. M. German and A. P. Sistla. Reasoning about systems with many processes.JACM, 39:675?735, 1992.","journal-title":"JACM"},{"key":"CR5","unstructured":"Z. Har'El and R. P. Kurshan. Modelling concurrent processes. InProceedings of Internat. Conf. Syst. Sci. Eng., pages 382?385, 1988."},{"key":"CR6","unstructured":"M. Hennessy.Algebraic Theory of Processes. MIT Press, 1988."},{"key":"CR7","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":"CR8","first-page":"414","volume":"430","author":"R. P. Kurshan","year":"1990","unstructured":"R. P. Kurshan. Analysis of discrete event coordination.LNCS, 430:414?453, 1990.","journal-title":"LNCS"},{"key":"CR9","unstructured":"R. P. Kurshan.Automata-Theoretic Verification of Coordinating Processes. UC Berkeley Lecture Notes, 1992."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"R. P. Kurshan and L. Lamport. Verification of a multiplier: 64 bits and beyond. InProceedings of CA (LNCS 697), pages 166?179, 1993.","DOI":"10.1007\/3-540-56922-7_14"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"R. P. Kurshan and K. McMillan. A structural induction theorem for processes. InProceedings of 8th ACM Symp. on Principles of Distributed Computing, pages 239?247, 1989.","DOI":"10.1145\/72981.72998"},{"key":"CR12","unstructured":"R. P. Kurshan, M. Merritt, A. Orda, and S. R. Sachs. Formal verification of a distributed algorithm for accessing faulty shared memory. InProceedings of SBT\/IEEE International Telecommunications Symposium, 1994."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. InProceedings of 6th ACM Symp. on Principles of Distributed Computing, pages 137?151, 1987.","DOI":"10.1145\/41840.41852"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"R. Milner. A calculus for communicating systems.LNCS, 92, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"CR15","first-page":"151","volume":"407","author":"Z. Shtadler","year":"1989","unstructured":"Z. Shtadler and O. Grumberg. Network grammars, communication behaviors and automatic verification.LNCS, 407:151?165, 1989.","journal-title":"LNCS"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01383832.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01383832\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01383832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T20:05:15Z","timestamp":1683057915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01383832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF01383832"],"URL":"https:\/\/doi.org\/10.1007\/bf01383832","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}