Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
: Development of distributed systems is complicated by the absence of reliable global timing, concurrency, and nondeterminism. To deal with these obstacles log files are produced b...
er presents an abstraction of Hoare logic to traced symmetric monoidal categories, a eral framework for the theory of systems. Our abstraction is based on a traced monoidal functor...
Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paul...
We describe an approach to the inductive synthesis of recursive equations from input/outputexamples which is based on the classical two-step approach to induction of functional Li...
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...