1532 search results - page 33 / 307 » The Symbol Grounding Problem |
133
Voted
RTSS
1998
IEEE
15 years 8 months ago
1998
IEEE
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
146
Voted
IJCAI
2003
15 years 5 months ago
2003
This paper addresses the formal verification of diagnosis systems. We tackle the problem of diagnosability: given a partially observable dynamic system, and a diagnosis system obs...
124
Voted
ISCIS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract—The notion of affordances was proposed by J.J. Gibson, to refer to the action possibilities offered to the organism by its environment. In a previous formalization, affo...
122
Voted
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
142
click to vote
GLVLSI
2002
IEEE
15 years 8 months ago
2002
IEEE
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...