Pages that link to "Item:Q3677184"

The following pages link to An Algorithm for the General Petri Net Reachability Problem (Q3677184):

Displaying 50 items.

• On selective unboundedness of VASS (Q355513) (← links)
• The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525) (← links)
• Checking system boundedness using ordinary differential equations (Q454908) (← links)
• Verification of membrane systems with delays via Petri nets with delays (Q496035) (← links)
• Collaborative planning with confidentiality (Q540688) (← links)
• On the verification of membrane systems with dynamic structure (Q609035) (← links)
• Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
• Encoding the dynamics of deterministic systems (Q634779) (← links)
• Reachability determination in acyclic Petri nets by cell enumeration approach (Q644287) (← links)
• Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
• Complexity results for 1-safe nets (Q672459) (← links)
• Proving nonreachability by modulo-invariants (Q672866) (← links)
• Reachability in cyclic extended free-choice systems (Q685410) (← links)
• Chip-firing games on directed graphs (Q685991) (← links)
• A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
• Reachability problems on reliable and lossy queue automata (Q825976) (← links)
• An exercise in structural congruence (Q845877) (← links)
• Mathematical programming approach to the Petri nets reachability problem (Q856211) (← links)
• Macro liveness graph and liveness of \(\omega\)-independent unbounded nets (Q893846) (← links)
• Decidability of a temporal logic problem for Petri nets (Q914407) (← links)
• Reachability analysis of fragments of mobile ambients in AC term rewriting (Q939167) (← links)
• Partially commutative inverse monoids. (Q958191) (← links)
• Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm (Q958302) (← links)
• On decidability of LTL model checking for process rewrite systems (Q1006890) (← links)
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
• Normal Petri nets (Q1057065) (← links)
• Petri nets and large finite sets (Q1060848) (← links)
• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
• Finding a partial solution to a linear system of equations in positive integers (Q1105986) (← links)
• Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
• Reduction and covering of infinite reachability trees (Q1173681) (← links)
• The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
• A unified approach for deciding the existence of certain petri net paths (Q1184737) (← links)
• Concurrent regular expressions and their relationship to Petri nets (Q1184987) (← links)
• Finite automata on directed graphs (Q1191024) (← links)
• The context-freeness of the languages associated with vector addition systems is decidable (Q1193880) (← links)
• Normal and sinkless Petri nets (Q1208921) (← links)
• Linear logic as a logic of computations (Q1326780) (← links)
• Petri net algorithms in the theory of matrix grammars (Q1342504) (← links)
• Deciding a class of path formulas for conflict-free Petri nets (Q1364130) (← links)
• Undecidable problems in unreliable computations. (Q1401309) (← links)
• Refining the hierarchy of blind multicounter languages and twist-closed trios. (Q1427852) (← links)
• A shrinking lemma for random forbidding context languages (Q1566715) (← links)
• Analysis issues in Petri nets with inhibitor arcs (Q1606123) (← links)
• On the decision problem for MELL (Q1733062) (← links)
• When ambients cannot be opened (Q1770415) (← links)
• Decidability of the Petri net reachability problem (Q1813788) (← links)
• On the finite containment problem for Petri nets (Q1819937) (← links)
• Fifo nets without order deadlock (Q1819941) (← links)
• Projections of vector addition system reachability sets are semilinear (Q1823697) (← links)