{"doi":"10.1007/11821069_53","title":"A Reachability Algorithm for General Petri Nets Based on Transition Invariants","abstract":null,"journal":"Lecture Notes in Computer Science","year":2006,"id":21135,"datarank":0.6330200065793712,"base_score":2.302585092994046,"endowment":2.302585092994046,"self_citation_contribution":0.3453877639491069,"citation_network_contribution":0.2876322426302642,"self_endowment_contribution":0.3453877639491069,"citer_contribution":0.2876322426302642,"corpus_percentile":null,"corpus_rank":null,"citation_count":9,"citer_count":9,"citers_with_citation_signal":5,"citers_with_endowment":5,"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":137240,"name":"Alexander E. Kostin","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.302585092994046,"endowment":2.302585092994046,"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/W1551903405","authors":[],"funders":[],"total_grants":0,"fwci":1.2552,"citation_percentile":0.78142627,"influential_citations":0,"citation_trend":[{"year":2012,"count":1},{"year":2017,"count":1},{"year":2023,"count":1},{"year":2024,"count":1},{"year":2025,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://link.springer.com/content/pdf/10.1007/11821069_53.pdf","host_type":"publisher"},{"url":"https://doi.org/10.1007/11821069_53","host_type":"book series"}],"fields_of_study":["Petri Nets in System Modeling","Business Process Modeling and Analysis","Service-Oriented Architecture and Web Services","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Reachability","Petri net","Stochastic Petri net","Computer science","Invariant (physics)","Path (computing)","Transition system","Reachability problem","Algorithm","Net (polyhedron)","Process architecture","Theoretical computer science","Discrete mathematics","Mathematics","Programming language","Geometry"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-06T14:40:06.663230Z","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":[]}