{"doi":"10.1016/0304-3975(86)90046-0","title":"Reachability trees for high-level petri nets","abstract":null,"journal":"Theoretical Computer Science","year":1986,"id":21306,"datarank":6.341007574294544,"base_score":4.174387269895637,"endowment":4.174387269895637,"self_citation_contribution":0.6261580904843456,"citation_network_contribution":5.714849483810198,"self_endowment_contribution":0.6261580904843456,"citer_contribution":5.714849483810198,"corpus_percentile":null,"corpus_rank":null,"citation_count":64,"citer_count":58,"citers_with_citation_signal":50,"citers_with_endowment":50,"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":137693,"name":"Arne M. Jensen","orcid":null,"position":1,"is_corresponding":false},{"id":137694,"name":"Leif O. Jepsen","orcid":null,"position":2,"is_corresponding":false},{"id":137695,"name":"Kurt Jensen","orcid":null,"position":3,"is_corresponding":false},{"id":137692,"name":"Peter Huber","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":4.174387269895637,"endowment":4.174387269895637,"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/W2092311420","authors":[],"funders":[],"total_grants":0,"fwci":0.9849,"citation_percentile":0.77231455,"influential_citations":5,"citation_trend":[{"year":2012,"count":1},{"year":2015,"count":1},{"year":2016,"count":3},{"year":2018,"count":1},{"year":2020,"count":2},{"year":2021,"count":1}],"oa_status":"closed","license":"https://www.elsevier.com/open-access/userlicense/1.0/","oa_locations":[{"url":"https://doi.org/10.1016/0304-3975(86)90046-0","host_type":"CLOSED"},{"url":"https://api.elsevier.com/content/article/PII:0304397586900460?httpAccept=text/xml","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:0304397586900460?httpAccept=text/plain","host_type":"publisher"},{"url":"https://pure.au.dk/portal/en/publications/f4051d70-cf9b-11de-a30a-000ea68e967b","host_type":""}],"fields_of_study":["Petri Nets in System Modeling","Formal Methods in Verification","Business Process Modeling and Analysis","Computer Science"],"mesh_terms":[],"keywords":["Petri net","Reachability","Stochastic Petri net","Process architecture","Computer science","Generalization","Theoretical computer science","Reachability problem","Transition system","Petri dish","Programming language","Mathematics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-06T15:26:34.423990Z","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":[]}