Pages that link to "Item:Q3510790"
From MaRDI portal
The following pages link to On the Efficient Computation of the Minimal Coverability Set for Petri Nets (Q3510790):
Displaying 5 items.
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- Unbounded-Thread Program Verification using Thread-State Equations (Q2817949) (← links)
- On the Efficient Computation of the Minimal Coverability Set for Petri Nets (Q3510790) (← links)
- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (Q3617740) (← links)
- Stop-transitions of Petri Nets* (Q4988957) (← links)