| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874043 | Information and Computation | 2014 | 16 Pages |
Abstract
We present a succinct, but naive, model-checking algorithm and then show how this can be improved. We investigate the complexity of model-checking, where repeated ODE solving emerges as a particular cost; assess some limitations of the technique; and identify potential routes to overcome these.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
C.J. Banks, I. Stark,