{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:58Z","timestamp":1725663658942},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544302"},{"type":"electronic","value":"9783540383574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54430-5_94","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:48:17Z","timestamp":1330210097000},"page":"266-280","source":"Crossref","is-referenced-by-count":10,"title":["Geometric logic, causality and event structures"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Gunawardena","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"20_CR1","unstructured":"S. Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 1989."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(89)90117-5","volume":"68","author":"M. Droste","year":"1989","unstructured":"M. Droste. Event structures and domains. Theoretical Computer Science, 68:37\u201347, 1989.","journal-title":"Theoretical Computer Science"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"J. Gunawardena. Causal Automata I: Confluence \u2261 {AN D, OR}-Causality. In M. Z. Kwiatkowska, M. W. Shields, and R. M. Thomas, editors, Semantics for Concurrency, pages 137\u2013156. Springer Workshops in Computing, 1990. To appear in TCS.","DOI":"10.1007\/978-1-4471-3860-0_9"},{"key":"20_CR4","unstructured":"J. Gunawardena. Eventless structures? (extended abstract). In Third Workshop on Concurrency and Compositionality, Goslar, March 1991."},{"key":"20_CR5","unstructured":"P. T. Johnstone. Stone Spaces, volume 3 of Studies in Advanced Mathematics. Cambridge University Press, 1982."},{"issue":"1","key":"20_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1090\/S0273-0979-1983-15080-2","volume":"8","author":"P. T. Johnstone","year":"1983","unstructured":"P. T. Johnstone. The point of pointless topology\u201d. Bulletin American Mathematical Society, 8(1):41\u201353, 1983.","journal-title":"Bulletin American Mathematical Society"},{"key":"20_CR7","unstructured":"R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice-Hall, 1989."},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures and domains. Theoretical Computer Science, 13:85\u2013108, 1981.","journal-title":"Theoretical Computer Science"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"M. Smyth. Powerdomains and predicate transformers: a topological view. In J. Diaz, editor, Automata, Languages and Programming. Springer LNCS 154, 1983.","DOI":"10.1007\/BFb0036946"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"P. S. Thiagarajan. Some behavioural aspects of net theory. In T. Lepist\u00f6 and A. Salomaa, editors, Automata, Languages and Programming. Springer LNCS 317, 1988.","DOI":"10.1007\/3-540-19488-6_147"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek and U. Goltz. Equivalence notions for concurrent systems and refinement of actions. Arbeitspapiere 366, GMD, February 1989.","DOI":"10.1007\/3-540-51486-4_71"},{"key":"20_CR12","unstructured":"S. Vickers. Topology via Logic, volume 5 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989."},{"key":"20_CR13","unstructured":"G. Winskel. Events in Computation. PhD thesis, University of Edinburgh, 1980."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Advances in Petri Nets. Springer LNCS 255, 1987.","DOI":"10.1007\/3-540-17906-2_31"}],"container-title":["Lecture Notes in Computer Science","CONCUR '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54430-5_94.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:26Z","timestamp":1605646466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}