{"doi":"10.1109/mascots.2006.33","title":"Non-reachability in Petri Nets with Delaying Places","abstract":null,"journal":"14th IEEE International Symposium on Modeling, Analysis, and Simulation","year":null,"id":21145,"datarank":0.0,"base_score":0.0,"endowment":0.0,"self_citation_contribution":0.0,"citation_network_contribution":0.0,"self_endowment_contribution":0.0,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":0,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"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":137259,"name":"G. Muhl","orcid":null,"position":1,"is_corresponding":false},{"id":10667,"name":"M. Werner","orcid":"0000-0001-8091-749X","position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":0.0,"endowment":0.0,"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/W1500907979","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.05102808,"influential_citations":0,"citation_trend":[],"oa_status":"closed","license":null,"oa_locations":[{"url":"https://doi.org/10.1109/mascots.2006.33","host_type":""},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.495.6975","host_type":""}],"fields_of_study":["Petri Nets in System Modeling","Business Process Modeling and Analysis","Formal Methods in Verification","Computer Science"],"mesh_terms":[],"keywords":["Reachability","Petri net","Correctness","Computer science","Stochastic Petri net","Reachability problem","Process architecture","State (computer science)","Theoretical computer science","Mathematical proof","Formal verification","Programming language","Mathematics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-06T14:42:52.407192Z","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":[]}