357 search results - page 12 / 72 » Computing Reachable States for Nonlinear Biological Models |
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
VLSID
2004
IEEE
16 years 1 days ago
2004
IEEE
Abstract--In this paper, we present a new approach to calculate the steady state resistance values for CMOS library gates. These resistances are defined as simple equivalent models...
66
Voted
SIAMAM
2008
14 years 11 months ago
2008
In this paper we define a class of formal neuron models being computationally efficient and biologically plausible, i.e., able to reproduce a wide range of behaviors observed in in...
118
Voted
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verificat...
88
Voted
CONCUR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...