{"doi":"10.1007/bf02737107","title":"The complexity of reachability in distributed communicating processes","abstract":null,"journal":"Acta Informatica","year":1988,"id":22208,"datarank":0.4212768290083803,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"self_citation_contribution":0.16479184330021646,"citation_network_contribution":0.25648498570816386,"self_endowment_contribution":0.16479184330021646,"citer_contribution":0.25648498570816386,"corpus_percentile":null,"corpus_rank":null,"citation_count":2,"citer_count":2,"citers_with_citation_signal":2,"citers_with_endowment":2,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":140411,"name":"Scott A. Smolka","orcid":null,"position":1,"is_corresponding":false},{"id":140410,"name":"John H. Reif","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21071399","pmcid":null,"openalex_id":"https://openalex.org/W4253760428","authors":[],"funders":[],"total_grants":0,"fwci":0.5301,"citation_percentile":0.71229521,"influential_citations":0,"citation_trend":[],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://www.springerlink.com/index/pdf/10.1007/BF02737107","host_type":"publisher"},{"url":"https://doi.org/10.1007/bf02737107","host_type":"journal"}],"fields_of_study":["Petri Nets in System Modeling","Distributed systems and fault tolerance","Service-Oriented Architecture and Web Services","Computer Science"],"mesh_terms":[],"keywords":["Reachability","Undecidable problem","Reachability problem","Decidability","Petri net","Computer science","Theory of computation","Theoretical computer science","Distributed computing","Computational complexity theory","Model checking","Queue","Algorithm","Programming language"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-06T18:17:41.953018Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}