{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T18:41:17Z","timestamp":1790793677955,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401831","type":"print"},{"value":"9783642401848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_34","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:50:56Z","timestamp":1374529856000},"page":"485-499","source":"Crossref","is-referenced-by-count":1,"title":["Generalizing Simulation to Abstract Domains"],"prefix":"10.1007","author":[{"given":"Vijay","family":"D\u2019Silva","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Chen, Y.-F., Hol\u00edk, L., Mayr, R., Vojnar, T.: When simulation meets antichains: on checking language inclusion of nondeterministic finite (tree) automata. In: Proc. of Tools and Algorithms for the Construction and Analysis of Systems, pp. 158\u2013174 (2010)","DOI":"10.1007\/978-3-642-12002-2_14"},{"issue":"1-2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Information and Computation"},{"issue":"6","key":"34_CR3","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1093\/jigpal\/7.6.683","volume":"7","author":"S.A. Celani","year":"1999","unstructured":"Celani, S.A., Jansana, R.: Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic. Logic Journal of the IGPL\u00a07(6), 683\u2013715 (1999)","journal-title":"Logic Journal of the IGPL"},{"issue":"4","key":"34_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.ic.2005.04.005","volume":"204","author":"C. C\u00eerstea","year":"2006","unstructured":"C\u00eerstea, C.: A modular approach to defining and characterising notions of simulation. Information and Computation\u00a0204(4), 469\u2013502 (2006)","journal-title":"Information and Computation"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proc. of Principles of Programming Languages, pp. 269\u2013282. ACM Press (1979)","DOI":"10.1145\/567752.567778"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Temporal abstract interpretation. In: Proc. of Principles of Programming Languages, pp. 12\u201325. ACM Press (2000)","DOI":"10.1145\/325694.325699"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Doyen, L., Raskin, J.-F.: Antichain algorithms for finite automata. In: Proc. of Tools and Algorithms for the Construction and Analysis of Systems (2010)","DOI":"10.1007\/978-3-642-12002-2_2"},{"issue":"1-2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"34_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.apal.2004.04.007","volume":"131","author":"M. Gehrke","year":"2005","unstructured":"Gehrke, M., Nagahashi, H., Venema, Y.: A Sahlqvist theorem for distributive modal logic. Annals of Pure and Applied Logic\u00a0131(1-3), 65\u2013102 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1042038.1042039","volume":"6","author":"T.A. Henzinger","year":"2005","unstructured":"Henzinger, T.A., Majumdar, R., Raskin, J.-F.: A classification of symbolic transition systems. ACM Transactions on Computational Logic\u00a06(1), 1\u201332 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"1-2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2004.07.022","volume":"327","author":"J. Hughes","year":"2004","unstructured":"Hughes, J., Jacobs, B.: Simulations in coalgebra. Theoretical Computer Science\u00a0327(1-2), 71\u2013108 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.2307\/2372074","volume":"74","author":"B. J\u00f3nsson","year":"1952","unstructured":"J\u00f3nsson, B., Tarski, A.: Boolean algebras with operators. American Journal of Mathematics\u00a074(1), 127\u2013162 (1952)","journal-title":"American Journal of Mathematics"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-19805-2_3","volume-title":"Foundations of Software Science and Computational Structures","author":"P.B. Levy","year":"2011","unstructured":"Levy, P.B.: Similarity quotients as final coalgebras. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 27\u201341. Springer, Heidelberg (2011)"},{"issue":"1","key":"34_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01384313","volume":"6","author":"C. Loiseaux","year":"1995","unstructured":"Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods in Systems Design\u00a06(1), 11\u201344 (1995)","journal-title":"Formal Methods in Systems Design"},{"issue":"2","key":"34_CR16","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N. Lynch","year":"1995","unstructured":"Lynch, N., Vaandrager, F.: Forward and backward simulations I: untimed systems. Information and Computation\u00a0121(2), 214\u2013233 (1995)","journal-title":"Information and Computation"},{"key":"34_CR17","first-page":"643","volume-title":"Foundations of Computer Science","author":"M. Maidl","year":"2000","unstructured":"Maidl, M.: The common fragment of CTL and LTL. In: Foundations of Computer Science, p. 643. IEEE Computer Society, Washington, DC (2000)"},{"issue":"1-2","key":"34_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(94)00047-M","volume":"139","author":"P. Malacaria","year":"1995","unstructured":"Malacaria, P.: Studying equivalences of transition systems with algebraic tools. Theoretical Computer Science\u00a0139(1-2), 187\u2013205 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"34_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1093\/logcom\/exl035","volume":"17","author":"F. Ranzato","year":"2007","unstructured":"Ranzato, F., Tapparo, F.: Generalized strong preservation by abstract interpretation. J. of Logic and Computation\u00a017(1), 157\u2013197 (2007)","journal-title":"J. of Logic and Computation"},{"issue":"4","key":"34_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1516507.1516510","volume":"31","author":"D. Sangiorgi","year":"2009","unstructured":"Sangiorgi, D.: On the origins of bisimulation and coinduction. ACM Transactions on Programming Languages and Systems\u00a031(4), 15:1\u201315:41 (2009)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: The linear time \u2013 branching time spectrum I. the semantics of concrete, sequential processes. In: Handbook of Process Algebra, pp. 3\u201399. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50019-9"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:42:51Z","timestamp":1557960171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}