乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:30:08Z","timestamp":1726065008591},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030389185"},{"type":"electronic","value":"9783030389192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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-38919-2_24","type":"book-chapter","created":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T17:03:18Z","timestamp":1579194198000},"page":"285-297","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Up-to Techniques for Branching Bisimilarity"],"prefix":"10.1007","author":[{"given":"Rick","family":"Erkens","sequence":"first","affiliation":[]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]},{"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,17]]},"reference":[{"issue":"8","key":"24_CR1","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF01191894","volume":"29","author":"S Arun-Kumar","year":"1992","unstructured":"Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Inf. 29(8), 737\u2013760 (1992)","journal-title":"Acta Inf."},{"issue":"1&2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(94)00152-9","volume":"146","author":"B Bloom","year":"1995","unstructured":"Bloom, B.: Structural operational semantics for weak bisimulations. TCS 146(1&2), 25\u201368 (1995)","journal-title":"TCS"},{"doi-asserted-by":"crossref","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. In: POPL, pp. 229\u2013239. ACM (1988)","key":"24_CR3","DOI":"10.1145\/73560.73580"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s00236-016-0271-4","volume":"54","author":"F Bonchi","year":"2017","unstructured":"Bonchi, F., Petrisan, D., Pous, D., Rot, J.: A general account of coinduction up-to. Acta Inf. 54(2), 127\u2013190 (2017)","journal-title":"Acta Inf."},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/2713167","volume":"58","author":"F Bonchi","year":"2015","unstructured":"Bonchi, F., Pous, D.: Hacking nondeterminism with induction and coinduction. Commun. ACM 58(2), 87\u201395 (2015)","journal-title":"Commun. ACM"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-11(2:14)2015","volume":"11","author":"T Brengos","year":"2015","unstructured":"Brengos, T.: Weak bisimulation for coalgebras over order enriched monads. Log. Methods Comput. Sci. 11(2), 1\u201344 (2015)","journal-title":"Log. Methods Comput. Sci."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ic.2017.10.003","volume":"257","author":"W Fokkink","year":"2017","unstructured":"Fokkink, W., van Glabbeek, R.: Divide and congruence II: from decomposition of modal formulas to preservation of delay and weak bisimilarity. Inf. Comput. 257, 79\u2013113 (2017)","journal-title":"Inf. Comput."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"104435","DOI":"10.1016\/j.ic.2019.104435","volume":"268","author":"W Fokkink","year":"2019","unstructured":"Fokkink, W., van Glabbeek, R., Luttik, B.: Divide and congruence III: from decomposition of modal formulas to preservation of stability and divergence. Inf. Comput. 268, 104435 (2019). https:\/\/doi.org\/10.1016\/j.ic.2019.104435 . Article no. 31 pages","journal-title":"Inf. Comput."},{"issue":"28","key":"24_CR9","doi-asserted-by":"publisher","first-page":"3283","DOI":"10.1016\/j.tcs.2011.02.036","volume":"412","author":"R Glabbeek van","year":"2011","unstructured":"van Glabbeek, R.: On cool congruence formats for weak bisimulations. TCS 412(28), 3283\u20133302 (2011)","journal-title":"TCS"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/3-540-57182-5_39","volume-title":"Mathematical Foundations of Computer Science 1993","author":"RJ Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In: Borzyszkowski, A.M., Soko\u0142owski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 473\u2013484. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57182-5_39"},{"doi-asserted-by":"crossref","unstructured":"Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science, vol. 59. Cambridge University Press, Cambridge (2016)","key":"24_CR11","DOI":"10.1017\/CBO9781316823187"},{"issue":"1","key":"24_CR12","first-page":"128","volume":"82","author":"B Jacobs","year":"2003","unstructured":"Jacobs, B., Hughes, J.: Simulations in coalgebra. ENTCS 82(1), 128\u2013149 (2003)","journal-title":"ENTCS"},{"unstructured":"Milner, R.: Communication and Concurrency. PHI Series in Computer Science. Prentice Hall, Upper Saddle River (1989)","key":"24_CR13"},{"issue":"2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","volume":"81","author":"R Milner","year":"1989","unstructured":"Milner, R.: A complete axiomatisation for observational congruence of finite-state behaviors. Inf. Comput. 81(2), 227\u2013247 (1989)","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"24_CR15","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.tcs.2007.02.060","volume":"380","author":"D Pous","year":"2007","unstructured":"Pous, D.: New up-to techniques for weak bisimulation. TCS 380(1\u20132), 164\u2013180 (2007)","journal-title":"TCS"},{"doi-asserted-by":"crossref","unstructured":"Pous, D.: Coinduction all the way up. In: LICS, pp. 307\u2013316. ACM (2016)","key":"24_CR16","DOI":"10.1145\/2933575.2934564"},{"doi-asserted-by":"crossref","unstructured":"Pous, D., Sangiorgi, D.: Enhancements of the bisimulation proof method (2012)","key":"24_CR17","DOI":"10.1017\/CBO9780511792588.007"},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. TCS 249(1), 3\u201380 (2000)","journal-title":"TCS"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/3-540-60246-1_153","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D Sangiorgi","year":"1995","unstructured":"Sangiorgi, D.: On the proof method for bisimulation. In: Wiedermann, J., H\u00e1jek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 479\u2013488. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60246-1_153"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0084781","volume-title":"CONCUR \u201992","author":"D Sangiorgi","year":"1992","unstructured":"Sangiorgi, D., Milner, R.: The problem of \u201cweak bisimulation up to\u201d. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 32\u201346. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0084781"},{"key":"24_CR21","volume-title":"The Pi-Calculus - A Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus - A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"unstructured":"Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: LICS, pp. 280\u2013291. IEEE (1997)","key":"24_CR22"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2020: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38919-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T18:19:24Z","timestamp":1665512364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38919-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030389185","9783030389192"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38919-2_24","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":"17 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","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":"20 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cyprusconferences.org\/sofsem2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"125","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":"40","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":"17","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":"32% - 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":"2.9","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.8","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)"}}]}}