{"id":"https://openalex.org/W4383046710","doi":"https://doi.org/10.4230/lipics.mfcs.2023.88","title":"Checking Presence Reachability Properties on Parameterized Shared-Memory Systems","display_name":"Checking Presence Reachability Properties on Parameterized Shared-Memory Systems","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4383046710","doi":"https://doi.org/10.4230/lipics.mfcs.2023.88"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2306.17476","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.17476","pdf_url":"https://arxiv.org/pdf/2306.17476","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2306.17476","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059113632","display_name":"Nicolas Waldburger","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Waldburger, Nicolas","raw_affiliation_strings":["SUMO - SUpervision of large MOdular and distributed systems (Campus de Beaulieu 35042 Rennes cedex - France)"],"affiliations":[{"raw_affiliation_string":"SUMO - SUpervision of large MOdular and distributed systems (Campus de Beaulieu 35042 Rennes cedex - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059113632"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08468462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.996999979019165,"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/T10142","display_name":"Formal Methods in Verification","score":0.9966999888420105,"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/reachability","display_name":"Reachability","score":0.933516800403595},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8951340913772583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7355273962020874},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6320543885231018},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6056229472160339},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5577088594436646},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5543604493141174},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5123180150985718},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.5031530261039734},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4892863929271698},{"id":"https://openalex.org/keywords/reading","display_name":"Reading (process)","score":0.4437124729156494},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.43794697523117065},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42245739698410034},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3268003463745117},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3088225722312927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2882518172264099},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23812758922576904},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.21398848295211792}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.933516800403595},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8951340913772583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7355273962020874},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6320543885231018},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6056229472160339},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5577088594436646},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5543604493141174},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5123180150985718},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.5031530261039734},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4892863929271698},{"id":"https://openalex.org/C554936623","wikidata":"https://www.wikidata.org/wiki/Q199657","display_name":"Reading (process)","level":2,"score":0.4437124729156494},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.43794697523117065},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42245739698410034},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3268003463745117},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3088225722312927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2882518172264099},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23812758922576904},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.21398848295211792},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2306.17476","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.17476","pdf_url":"https://arxiv.org/pdf/2306.17476","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"","raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:18622","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.88","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol272-mfcs2023/LIPIcs.MFCS.2023.88/LIPIcs.MFCS.2023.88.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},{"id":"pmh:oai:HAL:hal-04394124v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04394124v1/document","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"MFCS 2023 - Mathematical Foundations of Computer Science, Aug 2023, Bordeaux, France. pp.88:1-88:15, ⟨10.4230/LIPIcs.MFCS.2023.88⟩","raw_type":"Conference papers"},{"id":"doi:10.48550/arxiv.2306.17476","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2306.17476","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.mfcs.2023.88","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2023.88","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2306.17476","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.17476","pdf_url":"https://arxiv.org/pdf/2306.17476","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"","raw_type":"text"},"sustainable_development_goals":[{"score":0.6000000238418579,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4383046710.pdf","grobid_xml":"https://content.openalex.org/works/W4383046710.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W2099490078","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W4224983736","https://openalex.org/W1970063378"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,32,51,55,60,89,99,107,118,128,142],"verification":[3,67,109],"of":[4,8,12,57,62,93,110],"distributed":[5],"systems":[6,43],"composed":[7],"an":[9],"arbitrary":[10],"number":[11,56,61],"asynchronous":[13],"processes.":[14],"Processes":[15],"are":[16,64,73],"identical":[17],"finite-state":[18],"machines":[19],"that":[20,106,127,140],"communicate":[21],"by":[22,87],"reading":[23],"from":[24],"and":[25,59,134],"writing":[26],"to":[27,132],"a":[28],"shared":[29],"memory.":[30],"Beyond":[31],"standard":[33],"model":[34,120],"with":[35,44,121],"finitely":[36,122],"many":[37,123],"registers,":[38,124],"we":[39,104,125,135],"tackle":[40],"round-based":[41,102],"shared-memory":[42],"fresh":[45],"registers":[46,63],"at":[47],"each":[48],"round.":[49],"In":[50,98],"latter":[52],"model,":[53],"both":[54],"processes":[58,94],"unbounded,":[65],"making":[66],"particularly":[68],"challenging.":[69],"The":[70],"properties":[71,113],"studied":[72],"generic":[74],"presence":[75,90,111],"reachability":[76,112],"objectives,":[77],"which":[78],"subsume":[79],"classical":[80],"questions":[81],"such":[82],"as":[83],"safety":[84],"or":[85,91],"synchronization":[86],"expressing":[88],"absence":[92],"in":[95,145],"some":[96],"states.":[97],"more":[100],"general":[101],"setting,":[103],"establish":[105],"parameterized":[108],"is":[114],"PSPACE-complete.":[115],"Moreover,":[116],"for":[117],"roundless":[119],"prove":[126],"complexity":[129],"drops":[130],"down":[131],"NP-complete":[133],"provide":[136],"several":[137],"natural":[138],"restrictions":[139],"make":[141],"problem":[143],"solvable":[144],"polynomial":[146],"time.":[147]},"counts_by_year":[],"updated_date":"2026-04-24T08:23:43.765630","created_date":"2023-07-04T00:00:00"}