The following pages link to Petri nets and regular processes (Q1970202):
Displaying 32 items.
- Undecidability of performance equivalence of Petri nets (Q507373) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- P/R nets and process concepts. I (Q1201575) (← links)
- P/R nets and process concepts. II (Q1201589) (← links)
- Normal and sinkless Petri nets (Q1208921) (← links)
- Deciding true concurrency equivalences on safe, finite nets (Q1365677) (← links)
- Interleaving isotactics -- an equivalence notion on behaviour abstractions (Q1643139) (← links)
- Automated verification of automata communicating via FIFO and bag buffers (Q1650866) (← links)
- Decidability of split equivalence (Q1854504) (← 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)
- Branching Processes of General Petri Nets (Q3011885) (← links)
- (Q3377337) (← links)
- Process of petri nets extension (Q3415259) (← links)
- Trace Inclusion for One-Counter Nets Revisited (Q3447702) (← links)
- (Q3601872) (← links)
- (Q3838115) (← links)
- PETRI NETS AND STEP TRANSITION SYSTEMS (Q4032923) (← links)
- (Q4284252) (← links)
- (Q4332926) (← links)
- (Q4364400) (← links)
- (Q4417949) (← links)
- Universality Problem for Unambiguous VASS (Q5089303) (← links)
- (Q5089314) (← links)
- (Q5111264) (← links)
- (Q5472935) (← links)
- Process net reconstruction from the sequence of Petri net transition triggerings (Q5928733) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Nonprimitive recursive complexity and undecidability for Petri net equivalences (Q5941099) (← links)
- Language inclusion algorithms as complete abstract interpretations (Q6536285) (← links)
