We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstractions of a model into the model itself. This provides an efficient verification procedure, while giving the user fine-grained control of the level of abstraction by using a method similar to Counter-Example Guided Abstraction Refi...

This paper proposes a new abstract domain for languages on infinite alphabets, which acts as a functor taking an abstract domain for a concrete alphabet and lift it to an abstract domain for words on this alphabet. The abstract representation is based on lattice automata, which are finite automata labeled by elements of an atomic lattice. We define a normal form, standard language operations an...

Cellular automata (CA) are fully discrete, spatially-distributed dynamical systems which can serve as an alternative framework for mathematical descriptions of physical systems. Furthermore, they constitute intrinsically parallel models of computation which can be e ciently realized with special-purpose cellular automata machines. The basic objective of this thesis is to determine techniques fo...

Ever since von Neumann [Burks 1969], the question of modeling continuous physics with a discrete set of cellular automata has been raised, whether they handle discrete or continuous values. Many answers have been brought forth through, for instance, the work of Stephen Wolfram [Wolfram 1983] summarized in a recent book [Wolfram 2002]. This problem has been mostly tackled by rightfully consideri...

The rate-limiting step of some enzymatic reactions is a physical step, i.e. diffusion. The efficiency of such reactions can be improved through an increase in the arrival rate of the substrate molecules, e.g. by a directed passage of substrate (ligand) to active site after its random encounter with the enzyme surface. Herein, we introduce a cellular automata model simulating the ligand passage ...

For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However, when it comes to non-deterministic tree automata, none of these hierarchies is even close to be understood. Here we make an attempt in paving the way towards a clear understanding of tree automata. We concentrate on the class ...

Abstract. In this paper, a Cascaded Lattice Boltzmann Method with second order slip boundary conditions is developed to study gas flows in a microchannel in the slip and transition flow regimes with a wide range of Knudsen numbers. For the first time the effect of wall confinement is considered on the effective mean free path of the gas molecules using a function with nonconstant Bosanquet para...

Cellular automata (CA) are fully discrete, spatially-distributed dynamical systems which can serve as an alternative framework for mathematical descriptions of physical systems. Furthermore, they constitute intrinsically parallel models of computation which can be efficiently realized with special-purpose cellular automata machines. The basic objective of this thesis is to determine techniques ...