448 search results - page 46 / 90 » The Complexity of Codiagnosability for Discrete Event and Ti... |
BMCBI
2010
13 years 7 months ago
2010
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
SIROCCO
2010
13 years 9 months ago
2010
This paper studies local-control strategies to estimate the size of a certain event affecting an arbitrary connected subset of nodes in a network. For example, our algorithms allow...
ASPDAC
2004
ACM
13 years 11 months ago
2004
ACM
When time is incorporated in the specification of discrete systems, the complexity of verification grows exponentially. When the temporal behavior is specified with symbols, the ve...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...