{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:10:42Z","timestamp":1762459842910,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030435196"},{"type":"electronic","value":"9783030435202"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43520-2_5","type":"book-chapter","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T23:08:28Z","timestamp":1585696108000},"page":"65-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bisimilarity of Diagrams"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Dubut","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,1]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-28729-9_4","volume-title":"Foundations of Software Science and Computational Structures","author":"J Ad\u00e1mek","year":"2012","unstructured":"Ad\u00e1mek, J., Bonchi, F., H\u00fclsbusch, M., K\u00f6nig, B., Milius, S., Silva, A.: A coalgebraic perspective on minimization and determinization. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 58\u201373. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_4"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0022-0000(86)90029-2","volume":"32","author":"M Ben-Or","year":"1986","unstructured":"Ben-Or, M., Kozen, D., Reif, J.: The complexity of elementary algebra and geometry. J. Comput. Syst. Sci. 32, 251\u2013264 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0026984","volume-title":"Category Theory and Computer Science","author":"GL Cattani","year":"1997","unstructured":"Cattani, G.L., Stark, I., Winskel, G.: Presheaf models for the $$\\pi $$-calculus. In: Moggi, E., Rosolini, G. (eds.) CTCS 1997. LNCS, vol. 1290, pp. 106\u2013126. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0026984"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-662-47666-6_14","volume-title":"Automata, Languages, and Programming","author":"J Dubut","year":"2015","unstructured":"Dubut, J., Goubault, \u00c9., Goubault-Larrecq, J.: Natural homology. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 171\u2013183. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_14"},{"key":"5_CR6","unstructured":"Dubut, J., Goubault, E., Goubault-Larrecq, J.: Bisimulations and unfolding in P-accessible categorical models. In: Proceedings of the 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics, vol. 59, pp. 1\u201314. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"5_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15398-8","volume-title":"Directed Algebraic Topology and Concurrency","author":"L Fajstrup","year":"2016","unstructured":"Fajstrup, L., Goubault, E., Haucourt, E., Mimram, S., Raussen, M.: Directed Algebraic Topology and Concurrency. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-15398-8"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2004.11.026","volume":"128","author":"RJ van Glabbeek","year":"2005","unstructured":"van Glabbeek, R.J.: On the expresiveness of higher dimensional automata. Electron. Notes Theoret. Comput. Sci. 128(2), 5\u201334 (2005)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-10003-2_79","volume-title":"Automata, Languages and Programming","author":"M Hennessy","year":"1980","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 299\u2013309. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_79"},{"issue":"2","key":"5_CR10","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., Winskel, G.: Bisimulation from open maps. Inf. Comput. 127(2), 164\u2013185 (1996)","journal-title":"Inf. Comput."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(01)00023-8","volume":"280","author":"S Lasota","year":"2002","unstructured":"Lasota, S.: Coalgebra morphisms subsume open maps. Theoret. Comput. Sci. 280, 123\u2013135 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR12","volume-title":"Hilbert\u2019s 10th Problem","author":"Y Matiyasevitch","year":"1993","unstructured":"Matiyasevitch, Y.: Hilbert\u2019s 10th Problem. MIT Press, Cambridge (1993)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Pratt, V.: Modeling concurrency with geometry. In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 311\u2013322 (1991)","DOI":"10.1145\/99583.99625"},{"issue":"4","key":"5_CR14","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"11","author":"A Rabinovitch","year":"1988","unstructured":"Rabinovitch, A., Trakhtenbrot, B.: Behavior structures and nets. Fundamenta Informaticae 11(4), 357\u2013403 (1988)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W Savitch","year":"1970","unstructured":"Savitch, W.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR16","unstructured":"Srba, J.: Roadmap of infinite results. Online"},{"key":"5_CR17","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A Tarski","year":"1951","unstructured":"Tarski, A.: A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley (1951)"},{"issue":"4","key":"5_CR18","first-page":"429","volume":"83","author":"M Winter","year":"2008","unstructured":"Winter, M.: A relational algebraic theory of bisimulations. Fundamenta Informaticae 83(4), 429\u2013449 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-030-17127-8_30","volume-title":"Foundations of Software Science and Computation Structures","author":"T Wi\u00dfmann","year":"2019","unstructured":"Wi\u00dfmann, T., Dubut, J., Katsumata, S., Hasuo, I.: Path category for free. In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 523\u2013540. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_30"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43520-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:02:54Z","timestamp":1709665374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-43520-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030435196","9783030435202"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43520-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palaiseau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ramics18.gforge.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}