2878 search results - page 575 / 576 » Model Checking FTA |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
JAIR
2010
13 years 3 months ago
2010
We present DCL-PC: a logic for reasoning about how the abilities of agents and coalitions of agents are altered by transferring control from one agent to another. The logical foun...
MICRO
2010
IEEE
13 years 3 months ago
2010
IEEE
SARC merges cache controller and network interface functions by relying on a single hardware primitive: each access checks the tag and the state of the addressed line for possible...
GLOBECOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Motivated by the recent concept of Space-Time Shift Keying (STSK), we propose a novel cooperative STSK scheme, which is capable of achieving a flexible rate-diversity tradeoff, in ...
IANDC
2011
13 years 8 hour ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...