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...
We present work on a tool environment for model-based testing with the Abstract State Machine Language (AsmL). Our environment supports semiautomatic parameter generation, call seq...
Michael Barnett, Wolfgang Grieskamp, Lev Nachmanso...
This paper describes a framework to construct interface agents with example dialogs based on the tasks by the machine learning technology. The Wizard of Oz method is used to collec...