{"doi":"10.1016/0890-5401(90)90009-7","title":"Reduction and covering of infinite reachability trees","abstract":null,"journal":"Information and Computation","year":1990,"id":29429,"datarank":6.046863278324719,"base_score":4.382026634673881,"endowment":4.382026634673881,"self_citation_contribution":0.6573039952010823,"citation_network_contribution":5.389559283123637,"self_endowment_contribution":0.6573039952010823,"citer_contribution":5.389559283123637,"corpus_percentile":null,"corpus_rank":null,"citation_count":79,"citer_count":66,"citers_with_citation_signal":59,"citers_with_endowment":59,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":162310,"name":"Alain Finkel","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":4.382026634673881,"endowment":4.382026634673881,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24523987","pmcid":null,"openalex_id":"https://openalex.org/W1965726041","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.08188153,"influential_citations":8,"citation_trend":[{"year":2012,"count":4},{"year":2013,"count":3},{"year":2014,"count":4},{"year":2016,"count":3},{"year":2017,"count":1},{"year":2019,"count":1},{"year":2020,"count":3},{"year":2022,"count":2},{"year":2023,"count":1},{"year":2024,"count":1},{"year":2025,"count":3}],"oa_status":"closed","license":"https://www.elsevier.com/open-access/userlicense/1.0/","oa_locations":[{"url":"https://doi.org/10.1016/0890-5401(90)90009-7","host_type":"HYBRID"},{"url":"https://api.elsevier.com/content/article/PII:0890540190900097?httpAccept=text/xml","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:0890540190900097?httpAccept=text/plain","host_type":"publisher"}],"fields_of_study":["Petri Nets in System Modeling","Formal Methods in Verification","Model-Driven Software Engineering Techniques","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Reachability","Decidability","Petri net","Reachability problem","Reduction (mathematics)","Transition system","Tree (set theory)","Finite set","Mathematics","Set (abstract data type)","Discrete mathematics","Computer science","Combinatorics","Algorithm","Programming language"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T23:47:15.314582Z","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,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}