1701 search results - page 118 / 341 » Computer Science and State Machines |
SPIN
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present Beem — BEnchmarks for Explicit Model checkers. This benchmark set includes more than 50 parametrized models (300 concrete instances) together with their corr...
SIGBDP
1990
15 years 2 months ago
1990
Technique for Inducing Abstractions", Communications of the ACM, 21(5), 401411, May 1978. [7] Hayes-Roth, Frederick, "Rule-Based Systems", Communications of the ACM,...
AUTOMATICA
1999
14 years 9 months ago
1999
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
The processing power and memory capacity of independent and heterogeneous parallel machines can be combined to form a single parallel system that is more powerful than any of its ...