The following pages link to Concurrency in Boolean networks (Q6151158):
Displaying 4 items.
- Computing bottom SCCs symbolically using transition guided reduction (Q832201) (← links)
- Learning any memory-less discrete semantics for dynamical systems represented by logic programs (Q2102410) (← links)
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding (Q2112149) (← links)
- Petri nets semantics of reaction rules (RR). A language for ecosystems modelling (Q2165237) (← links)