{"id":"https://openalex.org/W1965726041","doi":"https://doi.org/10.1016/0890-5401(90)90009-7","title":"Reduction and covering of infinite reachability trees","display_name":"Reduction and covering of infinite reachability trees","publication_year":1990,"publication_date":"1990-12-01","ids":{"openalex":"https://openalex.org/W1965726041","doi":"https://doi.org/10.1016/0890-5401(90)90009-7","mag":"1965726041"},"language":"en","primary_location":{"id":"doi:10.1016/0890-5401(90)90009-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0890-5401(90)90009-7","pdf_url":null,"source":{"id":"https://openalex.org/S59933527","display_name":"Information and Computation","issn_l":"0890-5401","issn":["0890-5401","1090-2651"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051788925","display_name":"Alain Finkel","orcid":"https://orcid.org/0000-0003-0702-3232"},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Alain Finkel","raw_affiliation_strings":["\u00c9cole Normale Sup\u00e9rieure de Cachan, Laboratoire d'Informatique, 61, avenue du Pr\u00e9sident Wilson, 94235 Cachan, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Normale Sup\u00e9rieure de Cachan, Laboratoire d'Informatique, 61, avenue du Pr\u00e9sident Wilson, 94235 Cachan, France","institution_ids":["https://openalex.org/I11559806"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051788925"],"corresponding_institution_ids":["https://openalex.org/I11559806"],"apc_list":{"value":2630,"currency":"USD","value_usd":2630},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.08053062,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"89","issue":"2","first_page":"144","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9994999766349792,"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.9987000226974487,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9388071894645691},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8817222118377686},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.7813361883163452},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.7414950728416443},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6423207521438599},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.6386737823486328},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.530765950679779},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.49369630217552185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4901066720485687},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4634113013744354},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42750293016433716},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41010552644729614},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24068793654441833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21396106481552124},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05823850631713867}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9388071894645691},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8817222118377686},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7813361883163452},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.7414950728416443},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6423207521438599},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.6386737823486328},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.530765950679779},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.49369630217552185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4901066720485687},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4634113013744354},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42750293016433716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41010552644729614},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24068793654441833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21396106481552124},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05823850631713867},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0890-5401(90)90009-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0890-5401(90)90009-7","pdf_url":null,"source":{"id":"https://openalex.org/S59933527","display_name":"Information and Computation","issn_l":"0890-5401","issn":["0890-5401","1090-2651"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W71248221","https://openalex.org/W109966224","https://openalex.org/W182448688","https://openalex.org/W600072479","https://openalex.org/W1514194201","https://openalex.org/W1543926679","https://openalex.org/W1592689879","https://openalex.org/W1764891836","https://openalex.org/W1994350081","https://openalex.org/W2002089154","https://openalex.org/W2017140475","https://openalex.org/W2025970201","https://openalex.org/W2029117638","https://openalex.org/W2052423355","https://openalex.org/W2061093638","https://openalex.org/W2067782667","https://openalex.org/W2076508310","https://openalex.org/W2106001218","https://openalex.org/W2110697379","https://openalex.org/W2110917011","https://openalex.org/W2164003033","https://openalex.org/W2295768847","https://openalex.org/W2316437449","https://openalex.org/W2477698825","https://openalex.org/W6632648462","https://openalex.org/W6638079349","https://openalex.org/W6653116083","https://openalex.org/W6657778755","https://openalex.org/W6669870310","https://openalex.org/W6676507789"],"related_works":["https://openalex.org/W2032269072","https://openalex.org/W1989788631","https://openalex.org/W1999231617","https://openalex.org/W2961758588","https://openalex.org/W4224983736","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W2150468037","https://openalex.org/W1499073470"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}