{"id":"https://openalex.org/W2021941041","doi":"https://doi.org/10.1016/s1571-0661(05)01147-3","title":"Infinitely running concurrent processes with loops from a geometric viewpoint","display_name":"Infinitely running concurrent processes with loops from a geometric viewpoint","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2021941041","doi":"https://doi.org/10.1016/s1571-0661(05)01147-3","mag":"2021941041"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)01147-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)01147-3","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(05)01147-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050287992","display_name":"Lisbeth Fajstrup","orcid":"https://orcid.org/0000-0003-4936-1176"},"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":"Lisbeth Fajstrup","raw_affiliation_strings":["Department of Mathematical Sciences, Aalborg University Fredrik Bajers Vej 7E, DK-9220 Aalborg \u00d8, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Aalborg University Fredrik Bajers Vej 7E, DK-9220 Aalborg \u00d8, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008067606","display_name":"S. Soko\u0142owski","orcid":"https://orcid.org/0000-0003-0580-5214"},"institutions":[{"id":"https://openalex.org/I99542240","display_name":"Polish Academy of Sciences","ror":"https://ror.org/01dr6c206","country_code":"PL","type":"funder","lineage":["https://openalex.org/I99542240"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Stefan Sokolowski","raw_affiliation_strings":["Institute of Computer Science, Polish Academy of Sciences Cdansk Div., ul. Abrahama 18, 81-825 Sopot, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Polish Academy of Sciences Cdansk Div., ul. Abrahama 18, 81-825 Sopot, Poland","institution_ids":["https://openalex.org/I99542240","https://openalex.org/I4210087266"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008067606","https://openalex.org/A5050287992"],"corresponding_institution_ids":["https://openalex.org/I4210087266","https://openalex.org/I891191580","https://openalex.org/I99542240"],"apc_list":null,"apc_paid":null,"fwci":3.7132,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.93193791,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"39","issue":"2","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.989300012588501,"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/T10126","display_name":"Logic, programming, and type systems","score":0.989300012588501,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9868999719619751,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9776999950408936,"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/concurrency","display_name":"Concurrency","score":0.8954849243164062},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5393106937408447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5366563200950623},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4969222843647003},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4282544255256653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4000302255153656},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.390922874212265},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3776899576187134},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.33854958415031433},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2531062960624695},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11592033505439758}],"concepts":[{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8954849243164062},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5393106937408447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5366563200950623},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4969222843647003},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4282544255256653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4000302255153656},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.390922874212265},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3776899576187134},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.33854958415031433},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2531062960624695},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11592033505439758}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s1571-0661(05)01147-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)01147-3","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:CiteSeerX.psu:10.1.1.38.3377","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.3377","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.ipipan.gda.pl/stefan/reports/65-deloopings.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/04cfba00-9c2f-11db-8ed6-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/04cfba00-9c2f-11db-8ed6-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":"Fajstrup, L & Solokowski, S 2000, 'Infinitely running concurrent processes with loops from a geometric viewpoint', Electronical notes in theoretical computer science, vol. 39, no. 2.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/445af6a0-9cb4-11db-8ed6-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/445af6a0-9cb4-11db-8ed6-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":"Fajstrup, L & Sokolowski, S 2000, Infinitely running concurrent processes with loops from a geometric viewpoint. B R I C S Notes Series, no. NS-00-3, Department of Computer Science, Aarhus University, \u00c5rhus.","raw_type":"book"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)01147-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)01147-3","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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W3093036","https://openalex.org/W1582269801","https://openalex.org/W1966845790","https://openalex.org/W2042469880","https://openalex.org/W2052547749","https://openalex.org/W2106525918","https://openalex.org/W2112751084","https://openalex.org/W2987111343","https://openalex.org/W4211102632","https://openalex.org/W6600127457","https://openalex.org/W6634360786"],"related_works":["https://openalex.org/W1483314534","https://openalex.org/W3085024073","https://openalex.org/W2046435967","https://openalex.org/W2477601761","https://openalex.org/W59382029","https://openalex.org/W4231775656","https://openalex.org/W1888970550","https://openalex.org/W1965724121","https://openalex.org/W2001280137","https://openalex.org/W2788308474"],"abstract_inverted_index":{"This":[0],"report":[1],"gives":[2],"a":[3,58],"formal":[4],"topological":[5,31],"semantics":[6],"to":[7,44],"inductively":[8],"defined":[9],"concurrent":[10],"systems":[11],"and":[12,22,51],"investigates":[13],"the":[14,30,42,45],"properties":[15],"of":[16,33,61],"such":[17],"systems.":[18],"We":[19],"allow":[20],"loops":[21],"infinitely":[23],"running":[24],"computations,":[25],"which":[26],"is":[27],"new":[28],"in":[29],"investigations":[32],"concurrency.":[34],"In":[35],"this":[36],"more":[37],"general":[38],"setting,":[39],"we":[40],"prove":[41],"equivalent":[43],"result":[46],"from":[47],"[2]":[48],"that":[49],"deadlocks":[50],"unsafe":[52],"points":[53],"can":[54],"be":[55],"found":[56],"using":[57],"finite":[59],"number":[60],"deloopings.":[62]},"counts_by_year":[{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}