We show how properties of an interesting class of imperative programs can be calculated by means of relational modeling and symbolic computation. The ideas of [5, 26] are implement...
The paper is devoted to characterizing hybrid systems by specifying their possible runs, called processes, where each process is represented by a pomset in an intrinsic, global tim...
Genetic programming (Koza 1992) is a method of inducing behaviors represented as executable programs. The generality of the approach has spawned a proliferation of work in the evo...
The theory of evolutionary computation has been enhanced rapidly during the last decade. This survey is the attempt to summarize the results regarding the limit and nite time behav...
In this paper we will provide a detailed proof of the solvability of the halting and reachability problem for binary 2-tag systems. We will furthermore prove that an important sub...