{"id":"https://openalex.org/W2133863960","doi":"https://doi.org/10.1016/s1571-0661(04)80530-9","title":"Deciding Framed Bisimilarity","display_name":"Deciding Framed Bisimilarity","publication_year":2003,"publication_date":"2003-02-01","ids":{"openalex":"https://openalex.org/W2133863960","doi":"https://doi.org/10.1016/s1571-0661(04)80530-9","mag":"2133863960"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80530-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80530-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"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 Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80530-9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060535239","display_name":"Hans H\u00fcttel","orcid":"https://orcid.org/0000-0002-4603-5407"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Hans H\u00fcttel","raw_affiliation_strings":["Department of Computer Science, Aalborg University Aalborg, Denmark","Department of Computer Science, Aalborg  University, Aalborg, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalborg University Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Department of Computer Science, Aalborg  University, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5060535239"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":null,"apc_paid":null,"fwci":3.7454,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.93581974,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"68","issue":"6","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11504","display_name":"Advanced Authentication Protocols Security","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.7881381511688232},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.764005184173584},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.7375694513320923},{"id":"https://openalex.org/keywords/pi-calculus","display_name":"Pi calculus","score":0.686005711555481},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6331032514572144},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.5628165006637573},{"id":"https://openalex.org/keywords/situation-calculus","display_name":"Situation calculus","score":0.5342974066734314},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.4225423336029053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42251256108283997},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40587180852890015},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34703126549720764},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.33573973178863525},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23510685563087463},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2141861617565155},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1348360776901245}],"concepts":[{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.7881381511688232},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.764005184173584},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.7375694513320923},{"id":"https://openalex.org/C2984882572","wikidata":"https://www.wikidata.org/wiki/Q602886","display_name":"Pi calculus","level":2,"score":0.686005711555481},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6331032514572144},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.5628165006637573},{"id":"https://openalex.org/C22497172","wikidata":"https://www.wikidata.org/wiki/Q1559077","display_name":"Situation calculus","level":2,"score":0.5342974066734314},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.4225423336029053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42251256108283997},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40587180852890015},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34703126549720764},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33573973178863525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23510685563087463},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2141861617565155},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1348360776901245},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1016/s1571-0661(04)80530-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80530-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"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 Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/aa986fd2-4ce4-4c6a-a766-14dcbffbe622","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/aa986fd2-4ce4-4c6a-a766-14dcbffbe622","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Huttel, H 2003, 'Deciding framed bisimilarity', Electronic Notes in Theoretical Computer Science, vol. 68, no. 6, pp. 1-18. https://doi.org/10.1016/S1571-0661(04)80530-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.7666","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.7666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.auc.dk/~hans/Publications/spi-bisim.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.164.1545","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.1545","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk//RS/02/25/BRICS-RS-02-25.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.9715","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.9715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lamp.epfl.ch/~uwe/citations/./huettel:deciding-framed.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.2926","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.2926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lamp.epfl.ch/~uwe/citations/./huettel:infinity02.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/a64908e0-0032-11da-b4d5-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/a64908e0-0032-11da-b4d5-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Huttel, H 2002, Deciding Framed Bisimilarity. BRICS Research Report, no. RS-02-25, BRICS - Aarhus University, \u00c5rhus.","raw_type":"book"},{"id":"pmh:oai:pure.atira.dk:publications/aa986fd2-4ce4-4c6a-a766-14dcbffbe622","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=18944367110&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Huttel , H 2003 , ' Deciding framed bisimilarity ' , Electronic Notes in Theoretical Computer Science , vol. 68 , no. 6 , pp. 1-18 . https://doi.org/10.1016/S1571-0661(04)80530-9","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/fa446870-8ac1-11db-bb3d-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/fa446870-8ac1-11db-bb3d-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Huttel, H 2002, Deciding Framed Bisimilarity. in Proceedings of the 4th International Workshop on Verification (INFINITY'02), Brno, Czech Republic, August 24, 2002 : FIMU. RS-2002-04 edn, pp. 1-20, Deciding Framed Bisimilarity, 19/05/2010. < http://www.fi.muni.cz/infinity02/FIMU-RS-2002-04.pdf >","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80530-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80530-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"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 Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W184486697","https://openalex.org/W1506255920","https://openalex.org/W1542190420","https://openalex.org/W1583463787","https://openalex.org/W1586966546","https://openalex.org/W1603799276","https://openalex.org/W1965072559","https://openalex.org/W1994676271","https://openalex.org/W2001214919","https://openalex.org/W2012140001","https://openalex.org/W2027689693","https://openalex.org/W2106229972","https://openalex.org/W2128932399","https://openalex.org/W2505971749","https://openalex.org/W3022519507","https://openalex.org/W4285719527","https://openalex.org/W6634866280"],"related_works":["https://openalex.org/W2245963482","https://openalex.org/W2144618901","https://openalex.org/W2102465510","https://openalex.org/W1857037506","https://openalex.org/W2133863960","https://openalex.org/W2552390304","https://openalex.org/W2042757132","https://openalex.org/W2751004291","https://openalex.org/W2127712444","https://openalex.org/W1587877137"],"abstract_inverted_index":{"The":[0],"spi-calculus,":[1,33],"proposed":[2,71],"by":[3,72],"Abadi":[4,73],"and":[5,15,50,74],"Gordon,":[6,75],"is":[7,16,42,79],"a":[8],"process":[9],"calculus":[10],"based":[11],"on":[12],"the":[13,21,28,32],"\u03c0-calculus":[14],"intended":[17],"for":[18,81],"reasoning":[19],"about":[20],"behaviour":[22],"of":[23,31],"cryptographic":[24],"protocols.":[25],"We":[26],"consider":[27],"finite-control":[29],"fragment":[30],"showing":[34,76],"it":[35,78],"to":[36,58],"be":[37],"Turing-powerful":[38],"(a":[39],"result":[40],"which":[41],"joint":[43],"work":[44],"with":[45],"Josva":[46],"Kleist,":[47],"Uwe":[48],"Nestmann,":[49],"Bj\u00f6rn":[51],"Victor.)":[52],"Next,":[53],"we":[54,63],"restrict":[55],"our":[56],"attention":[57],"finite":[59],"(non-recursive)":[60],"spi-calculus.":[61],"Here,":[62],"show":[64],"that":[65,77],"framed":[66],"bisimilarity,":[67],"an":[68],"equivalence":[69],"relation":[70],"decidable":[80],"this":[82],"fragment.":[83]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}