Pages that link to "Item:Q2911620"
From MaRDI portal
The following pages link to Approximating Petri net reachability along context-free traces (Q2911620):
Displaying 17 items.
- Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263) (← links)
- A lazy query scheme for reachability analysis in Petri nets (Q2117184) (← links)
- The emptiness problem for valence automata over graph monoids (Q2662504) (← links)
- Interprocedural Reachability for Flat Integer Programs (Q2947875) (← links)
- (Q3146285) (← links)
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (Q3449486) (← links)
- (Q4223064) (← links)
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings (Q4982096) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- (Q5015278) (← links)
- Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)
- On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions (Q5060067) (← links)
- A Clustering Approach to Approximate the Timed Reachability Graph for a Class of Time Petri Nets (Q5092293) (← links)
- On Petri Nets with Hierarchical Special Arcs (Q5111656) (← links)
- (Q5207052) (← links)
- Decidable models of integer-manipulating programs with recursive parallelism (Q5915566) (← links)
- On the Petri net realization of context-free graphs (Q5941208) (← links)