{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:51:40Z","timestamp":1743144700996,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"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_17","type":"book-chapter","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T23:08:28Z","timestamp":1585696108000},"page":"270-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Unary Semigroup Trace Algebra"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4319-4872","authenticated-orcid":false,"given":"Pedro","family":"Ribeiro","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,1]]},"reference":[{"key":"17_CR1","volume-title":"Unifying Theories of Programming","author":"CAR Hoare","year":"1998","unstructured":"Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice-Hall, Upper Saddle River (1998)"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/69610.357988","volume":"27","author":"ECR Hehner","year":"1984","unstructured":"Hehner, E.C.R.: Predicative programming part I. Commun. ACM 27(2), 134\u2013143 (1984)","journal-title":"Commun. ACM"},{"key":"17_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-258-0","volume-title":"Understanding Concurrent Systems","author":"AW Roscoe","year":"2010","unstructured":"Roscoe, A.W.: Understanding Concurrent Systems. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-1-84882-258-0"},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00165-009-0119-6","volume":"22","author":"A Sherif","year":"2010","unstructured":"Sherif, A., Cavalcanti, A.L.C., He, J., Sampaio, A.C.A.: A process algebraic framework for specification and validation of real-time systems. Formal Aspects Comput. 22(2), 153\u2013191 (2010)","journal-title":"Formal Aspects Comput."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-35705-3_3","volume-title":"Unifying Theories of Programming","author":"K Wei","year":"2013","unstructured":"Wei, K., Woodcock, J., Cavalcanti, A.: Circus Time with reactive designs. In: Wolff, B., Gaudel, M.-C., Feliachi, A. (eds.) UTP 2012. LNCS, vol. 7681, pp. 68\u201387. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35705-3_3"},{"key":"17_CR6","unstructured":"Woodcock, J., Bryans, J., Canham, S., Foster, S.: The COMPASS modelling language: timed semantics in UTP. Open Channel Publishing, Communicating Process Architectures (2014)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-73210-5_5","volume-title":"Integrated Formal Methods","author":"A Butterfield","year":"2007","unstructured":"Butterfield, A., Sherif, A., Woodcock, J.: Slotted-circus: A UTP-family of reactive theories. In: Davies, J., Gibbons, J. (eds.) IFM 2007. LNCS, vol. 4591, pp. 75\u201397. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73210-5_5"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00165-009-0146-3","volume":"23","author":"A Butterfield","year":"2011","unstructured":"Butterfield, A.: A denotational semantics for Handel-C. Formal Aspects Comput. 23(2), 153\u2013170 (2011)","journal-title":"Formal Aspects Comput."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ipl.2018.02.017","volume":"135","author":"S Foster","year":"2018","unstructured":"Foster, S., Cavalcanti, A., Woodcock, J., Zeyda, F.: Unifying theories of time with generalised reactive processes. Inf. Process. Lett. 135, 47\u201352 (2018)","journal-title":"Inf. Process. Lett."},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-030-31038-7_5","volume-title":"Unifying Theories of Programming","author":"J Woodcock","year":"2019","unstructured":"Woodcock, J., Cavalcanti, A., Foster, S., Mota, A., Ye, K.: Probabilistic semantics for RoboChart. In: Ribeiro, P., Sampaio, A. (eds.) UTP 2019. LNCS, vol. 11885, pp. 80\u2013105. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31038-7_5"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-14806-9_2","volume-title":"Unifying Theories of Programming","author":"S Foster","year":"2015","unstructured":"Foster, S., Zeyda, F., Woodcock, J.: Isabelle\/UTP: a mechanised theory engineering framework. In: Naumann, D. (ed.) UTP 2014. LNCS, vol. 8963, pp. 21\u201341. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-14806-9_2"},{"key":"17_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198511946.001.0001","volume-title":"Fundamentals of Semigroup Theory","author":"JM Howie","year":"1995","unstructured":"Howie, J.M.: Fundamentals of Semigroup Theory, vol. 12. Clarendon Oxford, Oxford (1995)"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1016\/j.jpaa.2011.10.015","volume":"216","author":"C Cornock","year":"2012","unstructured":"Cornock, C., Gould, V.: Proper two-sided restriction semigroups and partial actions. J. Pure Appl. Algebra 216(4), 935\u2013949 (2012)","journal-title":"J. Pure Appl. Algebra"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.jpaa.2011.07.014","volume":"216","author":"PR Jones","year":"2012","unstructured":"Jones, P.R.: A common framework for restriction semigroups and regular *-semigroups. J. Pure Appl. Algebra 216(3), 618\u2013632 (2012)","journal-title":"J. Pure Appl. Algebra"},{"key":"17_CR15","volume-title":"Using Z - Specification, Refinement, and Proof","author":"JCP Woodcock","year":"1996","unstructured":"Woodcock, J.C.P., Davies, J.: Using Z - Specification, Refinement, and Proof. Prentice-Hall, Upper Saddle River (1996)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-52228-9_7","volume-title":"Unifying Theories of Programming","author":"P Ribeiro","year":"2017","unstructured":"Ribeiro, P., Cavalcanti, A., Woodcock, J.: A stepwise approach to linking theories. In: Bowen, J.P., Zhu, H. (eds.) UTP 2016. LNCS, vol. 10134, pp. 134\u2013154. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52228-9_7"},{"key":"17_CR17","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall Inc., Upper Saddle River (1985)"},{"key":"17_CR18","unstructured":"Mukarram, A.: A refusal testing model for CSP. Ph.D. thesis, University of Oxford (1993)"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","volume":"50","author":"I Phillips","year":"1987","unstructured":"Phillips, I.: Refusal testing. Theoret. Comput. Sci. 50(3), 241\u2013284 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-13321-3_12","volume-title":"Mathematics of Program Construction","author":"IJ Hayes","year":"2010","unstructured":"Hayes, I.J., Dunne, S.E., Meinicke, L.: Unifying theories of programming that distinguish nontermination and abort. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol. 6120, pp. 178\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13321-3_12"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.entcs.2005.11.070","volume":"155","author":"G Lowe","year":"2006","unstructured":"Lowe, G., Ouaknine, J.: On timed models and full abstraction. Electron. Notes Theor. Comput. Sci. 155, 497\u2013519 (2006)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00165-014-0309-8","volume":"27","author":"H Zhu","year":"2015","unstructured":"Zhu, H., He, J., Qin, S., Brooke, P.J.: Denotational semantics and its algebraic derivation for an event-driven system-level language. Formal Aspects Comput. 27(1), 133\u2013166 (2015)","journal-title":"Formal Aspects Comput."},{"key":"17_CR23","unstructured":"Barnes, J.E.: A mathematical theory of synchronous communication. University of Oxford (1993)"},{"key":"17_CR24","unstructured":"Smith, M.L.: A unifying theory of true concurrency based on CSP and lazy observation. In: Communicating Process Architectures 2005: WoTUG-28: Proceedings of the 28th WoTUG Technical Meeting, 18\u201321 September 2005, Technische Universiteit Eindhoven, the Netherlands, vol. 63, p. 177. IOS Press (2005)"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.tcs.2019.09.017","volume":"802","author":"S Foster","year":"2019","unstructured":"Foster, S., Cavalcanti, A., Canham, S., Woodcock, J., Zeyda, F.: Unifying theories of reactive design contracts. Theor. Comput. Sci. 802, 105\u2013140 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-030-31038-7_7","volume-title":"Unifying Theories of Programming","author":"S Foster","year":"2019","unstructured":"Foster, S.: Hybrid relations in Isabelle\/UTP. In: Ribeiro, P., Sampaio, A. (eds.) UTP 2019. LNCS, vol. 11885, pp. 130\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31038-7_7"},{"issue":"2","key":"17_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0167-6423(92)90005-V","volume":"19","author":"G Berry","year":"1992","unstructured":"Berry, G., Gonthier, G.: The Esterel synchronous programming language: design, semantics, implementation. Sci. Comput. Program. 19(2), 87\u2013152 (1992)","journal-title":"Sci. Comput. Program."}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:03:40Z","timestamp":1709665420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-43520-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030435196","9783030435202"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43520-2_17","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)"}}]}}