The following pages link to Petri nets and regular processes (Q1970202):
Displaying 12 items.
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Interleaving isotactics -- an equivalence notion on behaviour abstractions (Q1643139) (← links)
- Automated verification of automata communicating via FIFO and bag buffers (Q1650866) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Verifying chemical reaction network implementations: a pathway decomposition approach (Q2422010) (← links)
- Recursive Petri nets (Q2464034) (← links)
- Trace inclusion for one-counter nets revisited (Q2636512) (← links)
- Trace Inclusion for One-Counter Nets Revisited (Q3447702) (← links)
- Universality Problem for Unambiguous VASS (Q5089303) (← links)
- (Q5089314) (← links)
- (Q5111264) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
