{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:48:20Z","timestamp":1725468500075},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055761","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"117-128","source":"Crossref","is-referenced-by-count":2,"title":["Reasoning about the past"],"prefix":"10.1007","author":[{"given":"Mogens","family":"Nielsen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"8_CR1","unstructured":"Bednarczyk, M., Categories of Asynchronous Systems. Ph.D. Thesis in Computer Science, Univ. of Sussex, Report No. 1\/88, 1988."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Cattani, G.L., Fiore, M., Winskel,G., A Theory of Recursive Domains with Applications to Concurrency. To appear in Proceedings of LICS'98.","DOI":"10.1109\/LICS.1998.705658"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BFb0039058","volume":"458","author":"R. Nicola De","year":"1990","unstructured":"De Nicola, R., Montanari, U., and Vaandrager, F., Back and Forth Bisimulations. Proceedings of CONCUR'90, Springer Lecture Notes in Computer Science 458, pp. 152\u2013165, 1990.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R., Communicating Sequential Processes. Prentice Hall,1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"8_CR5","unstructured":"Hune, T., Nielsen, M., Timed Bisimulation and Open Maps. In this volume."},{"issue":"no.2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A. Joyal","year":"1996","unstructured":"Joyal, A., Nielsen, M. and Winskell, G., Bisimulation from Open Maps. Information and Computation, 127, no. 2, pp. 164\u2013185, 1996.","journal-title":"Information and Computation"},{"key":"8_CR7","unstructured":"Jurdzinski, M., Nielsen, M., On the Power of Past Modalities. In preparation."},{"issue":"7","key":"8_CR8","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"Keller, R.M., Formal Verification of Parallel Programs. CACM, 19(7), pp. 371\u2013384, 1976.","journal-title":"CACM"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","volume":"193","author":"O. Lichtenstein","year":"1985","unstructured":"Lichtenstein, O., Pnueli, A., and Zuck, L., The Glory of the Past. Springer Lecture Notes in Computer Science 193, pp. 196\u2013218, 1985.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"8_CR10","unstructured":"MacLane, S., and Moerdijk, I., Sheaves in geometry and logic: a first introduction to topos theory, Springer, 1992."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A., Basic notions of trace theory. In de Bakker, de Roever and Rozenberg (eds.), Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Springer Lecture Notes in Computer Science 354, pp. 285\u2013363, 1988.","DOI":"10.1007\/BFb0013025"},{"key":"8_CR12","unstructured":"Milner,A.J.R.G., Communication and concurrency. Prentice Hall, 1989."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G. and Winskel, G., Petri nets, Event structures and Domains, part 1. Theoretical Computer Science 13, pp. 85\u2013108, 1981.","journal-title":"Theoretical Computer Science"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-60692-0_54","volume":"1026","author":"M. Nielsen","year":"1995","unstructured":"Nielsen, M., Cheng, A., Observing Behaviour Categorically. Proc. of FST&TCS'15, Springer Lecture Notes in Computer Science 1026, pp. 263\u2013278, 1995.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"8_CR15","first-page":"385","volume":"836","author":"M. Nielsen","year":"1994","unstructured":"Nielsen, M., and Clausen, C., Bisimulations, Games, and Logic. Proc. of CONCUR'94, Springer Lecture Notes in Computer Science 836, pp. 385\u2013400, 1994.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0304-3975(95)00122-0","volume":"153","author":"M. Nielsen","year":"1996","unstructured":"Nielsen, M., and Winskel, G., Petri nets and bisimulations. Theoretical Computer Science, 153, pp. 211\u2013244, 1996.","journal-title":"Theoretical Computer Science"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Penczek, W., Kuiper, R., Traces and Logic. In The Book of Traces, eds. Diekert, V., Rozenberg, G., World Scientific, pp. 307\u2013390, 1994.","DOI":"10.1142\/9789814261456_0010"},{"key":"8_CR18","volume-title":"PhD thesis","author":"C.A. Petri","year":"1962","unstructured":"Petri, C.A. Kommunikation mit Automaten. PhD thesis, Institut f\u00fcr Instrumentelle Mathematik, Bonn, Germany, 1962."},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V.R. Pratt","year":"1986","unstructured":"Pratt, V.R., Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1), pp. 33\u201371, 1986.","journal-title":"International Journal of Parallel Programming"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","volume":"28","author":"M.W. Shields","year":"1985","unstructured":"Shields, M.W., Concurrent Machines, Comput. J., 28, pp. 449\u2013465, 1985.","journal-title":"Comput. J."},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"298 ff.","DOI":"10.1007\/3-540-61042-1_51","volume":"1055","author":"C. Stirling","year":"1996","unstructured":"Stirling, C., Games and Modal Mu-Calculus. Lecture Notes in Computer Science 1055, pp. 298 ff., 1996.","journal-title":"Lecture Notes in Computer Science"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0046835","volume":"254","author":"P.S. Thiagarajan","year":"1986","unstructured":"Thiagarajan, P.S., Elementary Net Systems. Springer Lecture Notes in Computer Science 254, pp. 26\u201359, 1986.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"8_CR23","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-15648-8_31","volume":"193","author":"M.Y. Vardi","year":"1985","unstructured":"Vardi, M.Y., The Taming of the Converse: Reasoning about Two-way Computations. Springer Lecture Notes in Computer Science 193, pp. 413\u2013424, 1985.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"8_CR24","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume":"255","author":"G. Winskel","year":"1987","unstructured":"Winskel, G., Event structures. Springer Lecture Notes in Computer Science 255, pp. 325\u2013392, 1987.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Winskel, G., and Nielsen, M., Models for concurrency. In the Handbook of Logic in Computer Science, vol. IV, ed. Abramsky, Gabbay and Maibaum, Oxford University Press, pp. 1\u2013148, 1995.","DOI":"10.1093\/oso\/9780198537809.003.0001"},{"key":"8_CR26","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-61604-7_50","volume":"1119","author":"G. Winskel","year":"1996","unstructured":"Winskel, G., A Presheaf Semantics of Value-Passing Processes. In the proc. of CONCUR'96, Springer Lecture Notes in Computer Science 1119, pp. 98\u2013114, 1996.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"8_CR27","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1090\/dimacs\/029\/08","volume":"29","author":"G. Winskel","year":"1997","unstructured":"Winskel, G., and Nielsen, M., Presheaves as Transition Systems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 29, pp. 129\u2013140, 1997.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T01:07:48Z","timestamp":1707181668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0055761","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}