Pages that link to "Item:Q1860056"
From MaRDI portal
The following pages link to On reachability graphs of Petri nets (Q1860056):
Displaying 17 items.
- Diagnosability of Petri nets with observation graphs (Q312654) (← links)
- Petri net representation of multi-valued logical regulatory graphs (Q553914) (← links)
- Using Petri nets during debugging to localize software errors (Q1115572) (← links)
- A structure to decide reachability in Petri nets (Q1193891) (← links)
- On persistent reachability in Petri nets (Q1951594) (← links)
- A lazy query scheme for reachability analysis in Petri nets (Q2117184) (← links)
- (Q3694702) (← links)
- (Q4207590) (← links)
- (Q4223064) (← links)
- (Q4606103) (← links)
- (Q4835904) (← links)
- Dynamic Slicing Techniques for Petri Nets (Q4982092) (← links)
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings (Q4982096) (← links)
- A Clustering Approach to Approximate the Timed Reachability Graph for a Class of Time Petri Nets (Q5092293) (← links)
- On the reachability and reversibility problems in a class of Petri nets (Q5365722) (← links)
- Applications and Theory of Petri Nets 2005 (Q5713501) (← links)
- On the Petri net realization of context-free graphs (Q5941208) (← links)