{"id":"https://openalex.org/W7101417980","doi":"https://doi.org/10.4204/eptcs.433.6","title":"Unique Solutions of Guarded Recursive Equations","display_name":"Unique Solutions of Guarded Recursive Equations","publication_year":2025,"publication_date":"2025-10-27","ids":{"openalex":"https://openalex.org/W7101417980","doi":"https://doi.org/10.4204/eptcs.433.6"},"language":"en","primary_location":{"id":"doi:10.4204/eptcs.433.6","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.433.6","pdf_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2025.6.pdf","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2025.6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Rob van Glabbeek","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["AU","GB"],"is_corresponding":true,"raw_author_name":"Rob van Glabbeek","raw_affiliation_strings":["School of Computer Science and Engineering , University of New South Wales , Sydney , Australia","School of Informatics , University of Edinburgh , UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering , University of New South Wales , Sydney , Australia","institution_ids":["https://openalex.org/I31746571"]},{"raw_affiliation_string":"School of Informatics , University of Edinburgh , UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I31746571","https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63486084,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"433","issue":null,"first_page":"65","last_page":"84"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11212","display_name":"Cultural Heritage Materials Analysis","score":0.9165999889373779,"subfield":{"id":"https://openalex.org/subfields/1204","display_name":"Archeology"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11212","display_name":"Cultural Heritage Materials Analysis","score":0.9165999889373779,"subfield":{"id":"https://openalex.org/subfields/1204","display_name":"Archeology"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13192","display_name":"Forensic Fingerprint Detection Methods","score":0.028599999845027924,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10640","display_name":"Spectroscopy and Chemometric Analyses","score":0.005400000140070915,"subfield":{"id":"https://openalex.org/subfields/1602","display_name":"Analytical Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/finitary","display_name":"Finitary","score":0.953499972820282},{"id":"https://openalex.org/keywords/kleenes-recursion-theorem","display_name":"Kleene's recursion theorem","score":0.692799985408783},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.593999981880188},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4999000132083893},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4936000108718872},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.4205999970436096},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.3774999976158142},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.350600004196167}],"concepts":[{"id":"https://openalex.org/C2778003309","wikidata":"https://www.wikidata.org/wiki/Q5450381","display_name":"Finitary","level":2,"score":0.953499972820282},{"id":"https://openalex.org/C123260079","wikidata":"https://www.wikidata.org/wiki/Q1933521","display_name":"Kleene's recursion theorem","level":2,"score":0.692799985408783},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.593999981880188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5189999938011169},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4999000132083893},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4936000108718872},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.4205999970436096},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3774999976158142},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3400000035762787},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.3314000070095062},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3172999918460846},{"id":"https://openalex.org/C85955891","wikidata":"https://www.wikidata.org/wiki/Q307772","display_name":"\u03bc operator","level":3,"score":0.31450000405311584},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2782999873161316},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.27079999446868896},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C9973445","wikidata":"https://www.wikidata.org/wiki/Q8349849","display_name":"Congruence relation","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.2563000023365021},{"id":"https://openalex.org/C201640847","wikidata":"https://www.wikidata.org/wiki/Q2362924","display_name":"Complete lattice","level":3,"score":0.2531000077724457}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.4204/eptcs.433.6","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.433.6","pdf_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2025.6.pdf","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2510.24206","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.24206","pdf_url":"https://arxiv.org/pdf/2510.24206","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/b894c79e-e65d-446c-9f38-d57aeefeeaa0","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/b894c79e-e65d-446c-9f38-d57aeefeeaa0","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"van Glabbeek, R 2025, Unique solutions of guarded recursive equations. in C Di Giusto & G Bacci (eds), Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics. Electronic Proceedings in Theoretical Computer Science, vol. 433, pp. 65-84, Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics, Aarhus, Denmark, 25/08/25. https://doi.org/10.4204/EPTCS.433.6","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.4204/eptcs.433.6","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.433.6","pdf_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2025.6.pdf","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7101417980.pdf","grobid_xml":"https://content.openalex.org/works/W7101417980.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"shows":[2],"that":[3],"guarded":[4,57],"systems":[5],"of":[6,68],"recursive":[7],"equations":[8],"have":[9],"unique":[10],"solutions":[11],"up":[12],"to":[13],"strong":[14,69],"bisimilarity":[15,70],"for":[16,33,36,41,56,71],"any":[17,72],"process":[18],"algebra":[19],"with":[20],"a":[21,46,63],"structural":[22],"operation":[23],"semantics":[24],"in":[25],"the":[26,42,59],"ready":[27,37],"simulation":[28,34,38,44],"format.A":[29],"similar":[30],"result":[31,61],"holds":[32],"equivalence,":[35],"equivalence":[39],"and":[40,50,65],"(ready)":[43],"preorder.As":[45],"consequence,":[47],"these":[48],"equivalences":[49],"preorders":[51],"are":[52],"full":[53],"(pre)":[54],"congruences":[55],"recursion.Moreover,":[58],"unique-solutions":[60],"yields":[62],"sound":[64],"groundcomplete":[66],"axiomatisation":[67],"finitary":[73],"GSOS":[74],"language.":[75]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-28T00:00:00"}