357 search results - page 31 / 72 » Computing Reachable States for Nonlinear Biological Models |
166
click to vote
AB
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. A well-known discrete approach to modeling biological regulatory networks is the logical framework developed by R. Thomas. The network structure is captured in an interac...
120
click to vote
SPIN
2007
Springer
15 years 10 months ago
2007
Springer
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
131
Voted
SPIN
2009
Springer
15 years 10 months ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
156
click to vote
BMCBI
2004
15 years 4 months ago
2004
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
142
Voted
JACM
2000
15 years 3 months ago
2000
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...