Pages that link to "Item:Q1235983"
From MaRDI portal
The following pages link to Some decision problems related to the reachability problem for Petri nets (Q1235983):
Displaying 17 items.
- Verification of membrane systems with delays via Petri nets with delays (Q496035) (← links)
- Recursivite et cônes rationnels fermés par intersection (Q1133331) (← links)
- Decidable problems on the strong connectivity of Petri net reachability sets (Q1240066) (← links)
- A well-structured framework for analysing Petri net extensions (Q1763373) (← links)
- Three measures for synchronic dependence in Petri nets (Q1836303) (← links)
- A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets (Q1960543) (← links)
- Synthesis of (choice-free) reset nets (Q2117175) (← links)
- Directed reachability for infinite-state systems (Q2233488) (← links)
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS (Q2581762) (← links)
- Weak and Nested Class Memory Automata (Q2799172) (← links)
- Discrete Parameters in Petri Nets (Q2941148) (← links)
- ML and Extended Branching VASS (Q2988645) (← links)
- (Q5009428) (← links)
- (Q5155662) (← links)
- (Q5155664) (← links)
- Decidable models of integer-manipulating programs with recursive parallelism (Q5915566) (← links)
- Well-structured transition systems everywhere! (Q5941101) (← links)
