The following pages link to (Q4835904):
Displaying 15 items.
- Reachability determination in acyclic Petri nets by cell enumeration approach (Q644287) (← links)
- Reachability in cyclic extended free-choice systems (Q685410) (← links)
- A sufficient condition for reachability in a general Petri net (Q702167) (← links)
- Normal Petri nets (Q1057065) (← links)
- Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263) (← links)
- A structure to decide reachability in Petri nets (Q1193891) (← links)
- On persistent reachability in Petri nets (Q1951594) (← links)
- On complexity of reachability of transition restricted Petri nets (Q2733997) (← links)
- Anti-alignments in Conformance Checking – The Dark Side of Process Models (Q2822655) (← links)
- (Q3361901) (← links)
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (Q3617755) (← links)
- (Q4223064) (← links)
- (Q4606103) (← links)
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings (Q4982096) (← links)
- On the reachability and reversibility problems in a class of Petri nets (Q5365722) (← links)