Pages that link to "Item:Q3569871"
From MaRDI portal
The following pages link to New Algorithms for Deciding the Siphon-Trap Property (Q3569871):
Displaying 8 items.
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014) (← links)
- Individuals, populations and fluid approximations: a Petri net based perspective (Q313335) (← links)
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding (Q2112149) (← links)
- On the fluidization of Petri nets and marking homothecy (Q2252988) (← links)
- Computation of strict minimal siphons in a class of Petri nets based on problem decomposition (Q2293269) (← links)
- Finding a Witness Path for Non-liveness in Free-Choice Nets (Q3011888) (← links)
- Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding (Q6175523) (← links)
- Taking Some Burden Off an Explicit CTL Model Checker (Q6184728) (← links)
