Pages that link to "Item:Q253470"

The following pages link to Identification of all steady states in large networks by logical analysis (Q253470):

Displaying 8 items.

• On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014) (← links)
• Logical reduction of biological networks to their most determinative components (Q517994) (← links)
• Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time (Q765479) (← links)
• Stable states of Boolean regulatory networks composed over hexagonal grids (Q2130578) (← links)
• Application of formal methods to biological regulatory networks: extending Thomas' asynchronous logical approach with temporal logic (Q2189295) (← links)
• Piecewise-linear models of genetic regulatory networks: equilibria and their stability (Q2369327) (← links)
• Algorithms for Inference, Analysis and Control of Boolean Networks (Q3599189) (← links)
• Boolean dynamics revisited through feedback interconnections (Q6151156) (← links)