Abstract. We introduce a generalised notion of a real-time speci cation language (\GPLC-Automata") that can be translated directly into real-time programs. In order to describ...
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
We study graded properties (α–properties) of fuzzy relations, which are parameterized versions of fuzzy relation properties defined by L.A. Zadeh. Namely, we take into account...
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...