{"doi":"10.3233/fun-2004-613-409","title":"A Method to Prove Non-Reachability in Priority Duration Petri \t\t\t Nets","abstract":"<jats:p>Times and priorities are important concepts that are frequently used to model real-world systems. Thus, there exist extensions for Petri nets which allow to model times and priorities. In contrast, many proof techniques are based on classical (time-less and priority-less) Petri nets. However, this approach fails frequently for timed and prioritized Petri nets. In this paper, we present an approach to prove non-reachability in a Priority Duration Petri net. We use for this proving technique a state equation as well as conditions for firing that include a priority rule and a maximal step rule. Our approach leads to a system of equations and inequalities, which provide us with a sufficient condition of non-reachability. We demonstrate the application of our approach with an example.</jats:p>","journal":"Fundamenta Informaticae","year":2004,"id":21143,"datarank":0.5642001222325019,"base_score":2.0794415416798357,"endowment":2.0794415416798357,"self_citation_contribution":0.31191623125197543,"citation_network_contribution":0.2522838909805265,"self_endowment_contribution":0.31191623125197543,"citer_contribution":0.2522838909805265,"corpus_percentile":null,"corpus_rank":null,"citation_count":7,"citer_count":7,"citers_with_citation_signal":4,"citers_with_endowment":4,"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":137255,"name":"Louchka Popova-Zeugmann","orcid":null,"position":1,"is_corresponding":false},{"id":137256,"name":"Jan Richling","orcid":null,"position":2,"is_corresponding":false},{"id":137254,"name":"Matthias Werner","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.0794415416798357,"endowment":2.0794415416798357,"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/W1531156418","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.07038123,"influential_citations":1,"citation_trend":[{"year":2015,"count":1},{"year":2017,"count":1},{"year":2018,"count":2}],"oa_status":"closed","license":"https://journals.sagepub.com/page/policies/text-and-data-mining-license","oa_locations":[{"url":"https://journals.sagepub.com/doi/pdf/10.3233/FUN-2004-613-409","host_type":"publisher"},{"url":"https://doi.org/10.3233/fun-2004-613-409","host_type":"journal"}],"fields_of_study":["Real-Time Systems Scheduling","Petri Nets in System Modeling","Distributed systems and fault tolerance","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Reachability","Petri net","Stochastic Petri net","Duration (music)","Computer science","Process architecture","Mathematics","Theoretical computer science","Distributed computing","Physics"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Reduced inequalities"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-06T14:42:13.070149Z","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":[]}