{"doi":"10.1007/s002360050066","title":"Reduction rules for time Petri nets","abstract":null,"journal":"Acta Informatica","year":1996,"id":21248,"datarank":3.1002688242480283,"base_score":3.6888794541139363,"endowment":3.6888794541139363,"self_citation_contribution":0.5533319181170905,"citation_network_contribution":2.546936906130938,"self_endowment_contribution":0.5533319181170905,"citer_contribution":2.546936906130938,"corpus_percentile":null,"corpus_rank":null,"citation_count":39,"citer_count":37,"citers_with_citation_signal":31,"citers_with_endowment":31,"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":137521,"name":"Ugo Buy","orcid":null,"position":1,"is_corresponding":false},{"id":137519,"name":"Robert H. Sloan","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":3.6888794541139363,"endowment":3.6888794541139363,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24259432","pmcid":null,"openalex_id":"https://openalex.org/W4255837018","authors":[],"funders":[],"total_grants":0,"fwci":1.0301,"citation_percentile":0.80248039,"influential_citations":0,"citation_trend":[{"year":2012,"count":2},{"year":2014,"count":1},{"year":2017,"count":1},{"year":2018,"count":1},{"year":2019,"count":1},{"year":2020,"count":1},{"year":2021,"count":1},{"year":2022,"count":1}],"oa_status":"closed","license":"http://www.springer.com/tdm","oa_locations":[{"url":"http://link.springer.com/content/pdf/10.1007/s002360050066.pdf","host_type":"publisher"},{"url":"http://link.springer.com/article/10.1007/s002360050066/fulltext.html","host_type":"publisher"},{"url":"http://link.springer.com/content/pdf/10.1007/s002360050066","host_type":"publisher"},{"url":"https://doi.org/10.1007/s002360050066","host_type":"journal"}],"fields_of_study":["Petri Nets in System Modeling","Business Process Modeling and Analysis","Formal Methods in Verification","Computer Science"],"mesh_terms":[],"keywords":["Petri net","Reachability","Stochastic Petri net","Concurrency","Reduction (mathematics)","Computer science","Process architecture","Equivalence (formal languages)","Reachability problem","Theory of computation","Theoretical computer science","Algorithm","Programming language","Mathematics","Discrete mathematics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-06T15:08:09.982012Z","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":[]}