7311 search results - page 254 / 1463 » Time in State Machines |
206
click to vote
CONCUR
2000
Springer
15 years 11 months ago
2000
Springer
Concurrency is an essential element of abstract models for embedded systems. Correctness and e ciency of the design depend critically on the way concurrency is formalized and imple...
160
click to vote
APN
2007
Springer
16 years 1 months ago
2007
Springer
This paper presents the ComBack method for explicit state space exploration. The ComBack method extends the well-known hash compaction method such that full coverage of the state s...
197
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
We present an algorithm for on-line, incremental discovery of temporal-difference (TD) networks. The key contribution is the establishment of three criteria to expand a node in TD...
198
click to vote
CCECE
2009
IEEE
16 years 2 months ago
2009
IEEE
This paper presents an automata-based approach for analyzing traces generated by the kernel of an operating system. We identified a list of typical patterns of problematic behavi...
192
click to vote
FOSSACS
2007
Springer
16 years 1 months ago
2007
Springer
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...