Pages that link to "Item:Q1238999"

The following pages link to Complexity of some problems in Petri nets (Q1238999):

Displaying 49 items.

• A survey of timed automata for the development of real-time systems (Q394966) (← links)
• Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
• Collaborative planning with confidentiality (Q540688) (← links)
• Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
• Complexity results for 1-safe nets (Q672459) (← links)
• Structure theory of equal conflict systems (Q672877) (← links)
• Global and local views of state fairness (Q804304) (← links)
• A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611) (← links)
• Reachability problems and abstract state spaces for time Petri nets with stopwatches (Q884758) (← links)
• Macro liveness graph and liveness of \(\omega\)-independent unbounded nets (Q893846) (← links)
• An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems (Q1097037) (← links)
• Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
• Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
• The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
• A polynomial-time algorithm to decide liveness of bounded free choice nets (Q1193656) (← links)
• Normal and sinkless Petri nets (Q1208921) (← links)
• Complexity of some problems in Petri nets (Q1238999) (← links)
• Time-based expressivity of time Petri nets for system specification (Q1285652) (← links)
• Deciding a class of path formulas for conflict-free Petri nets (Q1364130) (← links)
• On projective and separable properties (Q1389766) (← links)
• Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
• A multiparameter analysis of the boundedness problem for vector addition systems (Q1819938) (← links)
• Bounded self-stabilizing Petri nets (Q1892714) (← links)
• Parameterized model checking of networks of timed automata with Boolean guards (Q1989334) (← links)
• Verifying polymer reaction networks using bisimulation (Q2003997) (← links)
• A lightweight deadlock analysis for programs with threads and reentrant locks (Q2024377) (← links)
• Abstraction-based incremental inductive coverability for Petri nets (Q2117187) (← links)
• Waiting nets (Q2165233) (← links)
• Directed reachability for infinite-state systems (Q2233488) (← links)
• Complexity of the deadlock problem for Petri nets modeling resource allocation systems (Q2279727) (← links)
• Combining free choice and time in Petri nets (Q2291812) (← links)
• State space axioms for T-systems (Q2340253) (← links)
• Verifying chemical reaction network implementations: a bisimulation approach (Q2422008) (← links)
• Some observations on supervisory policies that enforce liveness in partially controlled free-choice Petri nets (Q2489594) (← links)
• A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
• Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems (Q2641226) (← links)
• Decidable Classes of Unbounded Petri Nets with Time and Urgency (Q2822660) (← links)
• Discrete Parameters in Petri Nets (Q2941148) (← links)
• Finding a Witness Path for Non-liveness in Free-Choice Nets (Q3011888) (← links)
• Weak Time Petri Nets Strike Back! (Q3184699) (← links)
• Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
• Symbolic Reachability Analysis of Integer Timed Petri Nets (Q3599107) (← links)
• Verification of Immediate Observation Population Protocols (Q5009448) (← links)
• Yeast: A case study for a practical use of formal methods (Q5044729) (← links)
• PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets (Q5100757) (← links)
• A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application (Q5166771) (← links)
• Structural Liveness of Immediate Observation Petri Nets (Q6044494) (← links)
• Waiting Nets: State Classes and Taxonomy (Q6189319) (← links)
• A state class based controller synthesis approach for time Petri nets (Q6535204) (← links)