88 search results - page 9 / 18 » Functional Reachability |
CDC
2009
IEEE
14 years 2 days ago
2009
IEEE
Abstract— This paper deals with realization theory of socalled Nash systems, i.e. nonlinear systems the right-hand side of which is defined by Nash functions. A Nash function is...
FSTTCS
2001
Springer
13 years 12 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
DEDS
2008
13 years 7 months ago
2008
Abstract Approximate simulation relations have recently been introduced as a powerful tool for the approximation of discrete and continuous systems. In this paper, we his abstracti...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
ENTCS
2002
13 years 7 months ago
2002
The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. Model checkers can pinpoint such errors and verify correctness...