{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:16:29Z","timestamp":1649121389792},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7716,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0022-0000(92)90011-7","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"411-424","source":"Crossref","is-referenced-by-count":0,"title":["Distributed event algebras"],"prefix":"10.1016","volume":"44","author":[{"given":"A.","family":"Klapper","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90011-7_BIB1","series-title":"Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing","first-page":"131","article-title":"Decentralization of process nets with centralized control","author":"Back","year":"1983"},{"key":"10.1016\/0022-0000(92)90011-7_BIB2","article-title":"A Theory of Atomic Transactions","author":"Fekete","year":"1988"},{"key":"10.1016\/0022-0000(92)90011-7_BIB3","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum weight spanning trees","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/0022-0000(92)90011-7_BIB4","article-title":"Internal Consistency of a Distributed Transaction System with Orphan Detection","author":"Goree","year":"1983"},{"key":"10.1016\/0022-0000(92)90011-7_BIB5","series-title":"The Science of Programming","author":"Gries","year":"1983"},{"key":"10.1016\/0022-0000(92)90011-7_BIB6","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/0022-0000(92)90011-7_BIB7","doi-asserted-by":"crossref","DOI":"10.1145\/588058.588080","article-title":"Concurrency Control for Resilient Nested Transactions","author":"Lynch","year":"1983"},{"key":"10.1016\/0022-0000(92)90011-7_BIB8","doi-asserted-by":"crossref","DOI":"10.1145\/41840.41852","article-title":"Hierarchical Correctness Proofs for Distributed Algorithms","author":"Lynch","year":"1987"},{"key":"10.1016\/0022-0000(92)90011-7_BIB9","article-title":"An Introduction to Input\/Output Automata","author":"Lynch","year":"1988"},{"key":"10.1016\/0022-0000(92)90011-7_BIB10","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/0022-0000(92)90011-7_BIB11","series-title":"Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing","first-page":"28","article-title":"Temporal logic for reasoning about partially ordered compuytations","author":"Pinter","year":"1984"},{"key":"10.1016\/0022-0000(92)90011-7_BIB12","series-title":"Proceedings of 2nd International Workshop on Distributed Algorithms","first-page":"408","article-title":"Stepwise removal of virtual channels in distributed algorithms","author":"Sere","year":"1987"},{"key":"10.1016\/0022-0000(92)90011-7_BIB13","article-title":"Foundations of a Theory of Specification for Distributed Systems","author":"Stark","year":"1984"},{"key":"10.1016\/0022-0000(92)90011-7_BIB14","series-title":"Proceedings of the 7th Annual Symposium on the Principles of Distributed Computing","first-page":"28","article-title":"A lattice-structured proof of a minimum spanning tree algorithm","author":"Welch","year":"1988-1988"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000092900117?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000092900117?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:57:12Z","timestamp":1550307432000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000092900117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["0022000092900117"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90011-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}