{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:13:16Z","timestamp":1746245596558,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662436127"},{"type":"electronic","value":"9783662436134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43613-4_14","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T07:56:40Z","timestamp":1400572600000},"page":"216-231","source":"Crossref","is-referenced-by-count":0,"title":["Dimming Relations for the Efficient Analysis of Concurrent Systems via Action Abstraction"],"prefix":"10.1007","author":[{"given":"Rocco","family":"De Nicola","sequence":"first","affiliation":[]},{"given":"Giulio","family":"Iacobelli","sequence":"additional","affiliation":[]},{"given":"Mirco","family":"Tribastone","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-540-75596-8_22","volume-title":"Automated Technology for Verification and Analysis","author":"D. Bo\u0161na\u010dki","year":"2007","unstructured":"Bo\u0161na\u010dki, D., Donaldson, A.F., Leuschel, M., Massart, T.: Efficient Approximate Verification of Promela Models Via Symmetry Markers. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol.\u00a04762, pp. 300\u2013315. Springer, Heidelberg (2007)"},{"key":"14_CR3","unstructured":"Roscoe, A.: The Theory and Practice of Concurrency. Prentice Hall (1997)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J. Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM\u00a051, 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Aldini, A., Bernardo, M., Corradini, F.: A Process Algebraic Approach to Software Architecture Design. Springer Publishing Company (2009)","DOI":"10.1007\/978-1-84800-223-4"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal on Computing\u00a016, 973\u2013989 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1530873.1530880","volume":"36","author":"M. Tribastone","year":"2009","unstructured":"Tribastone, M., Duguid, A., Gilmore, S.: The PEPA Eclipse Plug-in. Performance Evaluation Review\u00a036, 28\u201333 (2009)","journal-title":"Performance Evaluation Review"},{"key":"14_CR8","unstructured":"Milner, R.: An algebraic definition of simulation between programs. In: IJCAI, pp. 481\u2013489 (1971)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: FOCS, pp. 453\u2013462. IEEE Computer Society (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"key":"14_CR10","first-page":"238","volume-title":"POPL","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252. ACM, New York (1977)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Trans. Program. Lang. Syst.\u00a016, 1512\u20131542 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/244795.244800","volume":"19","author":"D. Dams","year":"1997","unstructured":"Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems. ACM Trans. Program. Lang. Syst.\u00a019, 253\u2013291 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-78163-9_13","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"H. Fecher","year":"2008","unstructured":"Fecher, H., Huth, M.: Model checking for action abstraction. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 112\u2013126. Springer, Heidelberg (2008)"},{"key":"14_CR14","unstructured":"Thomsen, B.: An extended bisimulation induced by a preorder on actions. M.Sc. thesis, Aalborg University (1987)"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"6058","DOI":"10.1016\/j.tcs.2011.07.006","volume":"412","author":"V. Galpin","year":"2011","unstructured":"Galpin, V.: Equivalences for a biological process algebra. TCS\u00a0412, 6058\u20136082 (2011)","journal-title":"TCS"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/3-540-61604-7_76","volume-title":"CONCUR \u201996: Concurrency Theory","author":"A. Fantechi","year":"1996","unstructured":"Fantechi, A., Gnesi, S., Latella, D.: Towards automatic temporal logic verification of value passing process algebra using abstract interpretation. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 563\u2013578. Springer, Heidelberg (1996)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-51486-4_71","volume-title":"Mathematical Foundations of Computer Science 1989","author":"R. Glabbeek","year":"1989","unstructured":"Glabbeek, R., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol.\u00a0379, pp. 237\u2013248. Springer, Heidelberg (1989)"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/inco.1993.1019","volume":"103","author":"L. Aceto","year":"1993","unstructured":"Aceto, L., Hennessy, M.: Towards action-refinement in process algebras. Information and Computation\u00a0103, 204\u2013269 (1993)","journal-title":"Information and Computation"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Gorrieri, R., Rensink, A., Zamboni, M.A.: Action refinement. In: Handbook of Process Algebra, pp. 1047\u20131147. Elsevier (2000)","DOI":"10.1016\/B978-044482830-9\/50034-5"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511777110"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. J. ACM\u00a042, 232\u2013268 (1995)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43613-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T23:50:02Z","timestamp":1746229802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43613-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662436127","9783662436134"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43613-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}