15614 search results - page 146 / 3123 » The State of State |
143
click to vote
TOOLS
1999
IEEE
15 years 8 months ago
1999
IEEE
The goal of this paper is to obtain a one-to-one correspondence between state machines as e.g. used in UML and object-oriented programming languages. A proposal is made for a lang...
119
Voted
MFCS
1998
Springer
15 years 8 months ago
1998
Springer
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
117
click to vote
ICDCS
1993
IEEE
15 years 7 months ago
1993
IEEE
In this paper, we propose a diagnostic algorithm for the case where distributed system specifications (implementations) are given in the form of communicating finite state machine...
130
Voted
CIVR
2004
Springer
15 years 7 months ago
2004
Springer
We address the problem of classifying scenes from feature films into semantic categories and propose a robust framework for this problem. We propose that the Finite State Machines ...
141
click to vote
ICCD
1995
IEEE
15 years 7 months ago
1995
IEEE
– This paper describes a new technique for extracting clock-level finite state machines(FSMs) from transistor netlists using symbolic simulation. The transistor netlist is prepr...