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...
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...
State machine based simulation of Boolean functions is substantially faster if the function being simulated is symmetric. Unfortunately function symmetries are comparatively rare....
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
Abstract. We compare three specification frameworks for the operationtics of programming languages, abstract state machines (ASMs) and the two incarnations of natural semantics, b...