Pages that link to "Item:Q3677184"
From MaRDI portal
The following pages link to An Algorithm for the General Petri Net Reachability Problem (Q3677184):
Displaying 27 items.
- (Q5111264) (← links)
- On Petri Nets with Hierarchical Special Arcs (Q5111656) (← links)
- Open Petri nets (Q5139283) (← links)
- (Q5155662) (← links)
- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application (Q5166771) (← links)
- Reachability in Timed Counter Systems (Q5179060) (← links)
- Regular Graphs and the Spectra of Two-Variable Logic with Counting (Q5258916) (← links)
- Decidability of code properties (Q5425746) (← links)
- On the Reachability Problem in P Systems with Mobile Membranes (Q5452051) (← links)
- On the Dynamics of PB Systems with Volatile Membranes (Q5452060) (← links)
- Applications and Theory of Petri Nets 2004 (Q5712340) (← links)
- The undecidability theorem for the Horn-like fragment of linear logic (Revisited) (Q5741577) (← links)
- (Q5875390) (← links)
- Applying CEGAR to the Petri Net State Equation (Q5892497) (← links)
- A pumping lemma for random permitting context languages (Q5958343) (← links)
- Infinite results (Q6104374) (← links)
- Computing with chemical reaction networks: a tutorial (Q6150974) (← links)
- Constrained properties, semilinear systems, and Petri nets (Q6162100) (← links)
- On the reversibility of circular conservative Petri nets (Q6535198) (← links)
- Concurrent hyperproperties (Q6535831) (← links)
- Round- and context-bounded control of dynamic pushdown systems (Q6564172) (← links)
- Reasoning about reversal-bounded counter machines (Q6599624) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
- Ackermannian completion of separators (Q6629446) (← links)
- Reachability in fixed VASS: expressiveness and lower bounds (Q6629526) (← links)
- Reasoning on data words over numeric domains (Q6649469) (← links)
- On decision problems concerning contextual insertions and deletions (Q6652448) (← links)
