7311 search results - page 374 / 1463 » Time in State Machines |
208
click to vote
ASPDAC
1995
ACM
15 years 11 months ago
1995
ACM
Abstract - An approach to top down design for testability using register-transfer level(RTL) partial scan selection is described. We propose a scan selection technique based on tes...
203
click to vote
EWHCI
1995
15 years 11 months ago
1995
Diagrams (e.g., trees for hierarchical structures, or graphs for finite state machines) are often needed as part of advanced user interfaces, and are frequently specific to a use...
220
click to vote
CONCUR
2008
Springer
15 years 9 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
185
click to vote
PTS
2007
15 years 9 months ago
2007
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
218
click to vote
DAGSTUHL
1994
15 years 9 months ago
1994
Abstract. Rampart is a toolkit of protocols to facilitate the development of high-integrity services, i.e., distributed services that retain their availability and correctness desp...