{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:16Z","timestamp":1725664696458},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630456"},{"type":"electronic","value":"9783540690658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:00:31Z","timestamp":1330279231000},"page":"294-305","source":"Crossref","is-referenced-by-count":1,"title":["Capturing bisimulation-invariant Ptime"],"prefix":"10.1007","author":[{"given":"Martin","family":"Otto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1007\/BF03180566","volume":"4","author":"J. Balcazar","year":"1992","unstructured":"J. Balcazar, J. Gabarro and M. Santha, Deciding bisimilarity is P-complete, Formal Aspects of Computing, 4, 1992, pp. 638\u2013648.","journal-title":"Formal Aspects of Computing"},{"key":"30_CR2","unstructured":"J. Barwise and J. van Benthem, Interpolation, preservation, and pebble games, preprint, 1996."},{"key":"30_CR3","unstructured":"J. Barwise and L. Moss, Modal correspondence for models, preprint, 1996."},{"key":"30_CR4","unstructured":"J. van Benthem, Modal correspondence theory, PhD thesis, University of Amsterdam, 1976."},{"key":"30_CR5","unstructured":"-, Modal Logic and Classical Logic, Bibliopolis, 1985."},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A. Chandra","year":"1982","unstructured":"A. Chandra and D. Harel, Structure and complexity of relational queries, Journal of Computer and System Sciences, 25, 1982, pp. 99\u2013128.","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"H.-D. Ebbinghaus and J. Flum, Finite Model Theory, Springer, 1995.","DOI":"10.1007\/3-540-28788-4"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"E. Emerson, Temporal and modal logic, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, Elsevier, 1990, pp. 995\u20131072.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"30_CR9","unstructured":"Y. Gurevich, Logic and the challenge of computer science, in E. B\u00f6rger (ed.), Current Trends in Theoretical Computer Science, Computer Science Press, 1988, pp. 1\u201357."},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","volume":"32","author":"Y. Gurevich","year":"1986","unstructured":"Y. Gurevich and S. Shelah, Fixed-point extensions of first-order logic, Annals of Pure and Applied Logic, 32 (1986), pp. 265\u2013280.","journal-title":"Annals of Pure and Applied Logic"},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N. Immerman","year":"1986","unstructured":"N. Immerman, Relational queries computable in polynomial time, Information and Control, 68, 1986, pp. 86\u2013104.","journal-title":"Information and Control"},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen, Results on the propositional \u039c-calculus, Theoretical Computer Science, 27, 1983, pp. 333\u2013354.","journal-title":"Theoretical Computer Science"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"M. Otto, Canonization for two variables and puzzles on the square, to appear in Annals of Pure and Applied Logic, 1997.","DOI":"10.1016\/S0168-0072(96)00047-4"},{"key":"30_CR15","unstructured":"-, Bounded Variable Logics and Counting \u2014 A Study in Finite Models, Lecture Notes in Logic, vol. 9, Springer, 1997."},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"D. Park, Concurrency and automata on infinite sequences, in: P. Deussen (ed.) Proc. 5th GI-Conf. on Theoretical Computer Science, Lecture Notes in Computer Science, vol. 104, Springer, 1981, pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"M. Vardi, The complexity of relational query languages, in Proc. 14th ACM Symp. on Theory of Computing, 1982, pp. 137\u2013146.","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:16Z","timestamp":1605629716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}