{"doi":"10.1002/9780470611647.ch4","title":"Decidability and Complexity of Petri Net Problems","abstract":null,"journal":"Petri Nets","year":2009,"id":29654,"datarank":0.623292358423819,"base_score":2.1972245773362196,"endowment":2.1972245773362196,"self_citation_contribution":0.32958368660043297,"citation_network_contribution":0.293708671823386,"self_endowment_contribution":0.32958368660043297,"citer_contribution":0.293708671823386,"corpus_percentile":null,"corpus_rank":null,"citation_count":8,"citer_count":8,"citers_with_citation_signal":6,"citers_with_endowment":6,"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":163019,"name":"Serge Haddad","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.1972245773362196,"endowment":2.1972245773362196,"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/W1608728926","authors":[],"funders":[],"total_grants":0,"fwci":null,"citation_percentile":null,"influential_citations":0,"citation_trend":[{"year":2014,"count":2},{"year":2016,"count":1},{"year":2018,"count":1},{"year":2020,"count":1},{"year":2022,"count":1}],"oa_status":"closed","license":"http://doi.wiley.com/10.1002/tdm_license_1.1","oa_locations":[{"url":"https://onlinelibrary.wiley.com/doi/pdf/10.1002/9780470611647.ch4","host_type":"publisher"},{"url":"https://doi.org/10.1002/9780470611647.ch4","host_type":""}],"fields_of_study":["Petri Nets in System Modeling","Formal Methods in Verification","semigroups and automata theory","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Petri net","Reachability","Decidability","Reachability problem","Computer science","Stochastic Petri net","Graph","Process architecture","Petri dish","Programming language","Theoretical computer science","Mathematics","Discrete mathematics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-09T00:24:19.564088Z","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":[]}