{"doi":"10.4230/lipics.fsttcs.2011.140","title":"Unknown","abstract":null,"journal":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","year":null,"id":28749,"datarank":0.2603955214577785,"base_score":1.3862943611198906,"endowment":1.3862943611198906,"self_citation_contribution":0.20794415416798362,"citation_network_contribution":0.052451367289794874,"self_endowment_contribution":0.20794415416798362,"citer_contribution":0.052451367289794874,"corpus_percentile":null,"corpus_rank":null,"citation_count":3,"citer_count":1,"citers_with_citation_signal":1,"citers_with_endowment":1,"datacite_reuse_total":1,"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":[],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":1.3862943611198906,"endowment":1.3862943611198906,"datacite_reuse_total":1,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W2170745499","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.18134317,"influential_citations":0,"citation_trend":[{"year":2016,"count":1},{"year":2018,"count":2}],"oa_status":"green","license":"other-oa","oa_locations":[{"url":"https://inria.hal.science/inria-00627657","host_type":"repository"},{"url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.140","host_type":"repository"},{"url":"https://doi.org/10.4230/lipics.fsttcs.2011.140","host_type":"repository"}],"fields_of_study":["Petri Nets in System Modeling","Logic, Reasoning, and Knowledge","Formal Methods in Verification","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Petri nets","First order logic","Reachability graph","Decidability","Reachability","Petri net","Undecidable problem","Reachability problem","Computer science","Robustness (evolution)","Theoretical computer science","Discrete mathematics","Mathematics","Algorithm"],"sdg_mappings":[],"linked_datasets":[{"doi":"10.4230/lipics.fsttcs.2011","title":"LIPIcs, Volume 13, FSTTCS'11, Complete Volume","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferenceProceeding"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T22:02:37.029042Z","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":[]}