1. Introductory remarks Classical set theory and the theory of computable (recursive) functions are the basic areas between which the theory of recursive equivalence forms a bridge. Recursive functions of k arguments are those functions from the k = n cartesian product xN = Nx ...xN (k times) of the natural numbers N = {0,1,2,...} into N which are defined on the whole of JV and whose values can...

Quality requirements, like security requirements, are difficult to elicit, especially if they cross multiple domains. Understanding these domains is an important issue in the requirements engineering process for the corresponding systems. Well-known requirements engineering approaches, such as goal-oriented techniques provide a good starting point in capturing security requirements in the form ...

In this paper, we generalize the definitions of transitivity, reflexivity, symmetry, euclidean and serial properties of relations in the context of a functional approach for temporal×modal logic. The main result is the proof of definability of these definitions which is obtained by using algebraic characterizations. As a consequence, we will have in our temporal×modal context the generalization...

GSOS RULES AND A MODULAR TREATMENT OF RECURSIVE DEFINITIONS STEFAN MILIUS , LAWRENCE S. MOSS , AND DANIEL SCHWENCKE c a Lehrstuhl für Theoretische Informatik, Friedrich-Alexander Universität Erlangen-Nürnberg, Germany e-mail address: [email protected] b Department of Mathematics, Indiana University, Bloomington, IN, USA e-mail address: [email protected] c Institute of Transportation System...

Abstract We consider here the problem of constructing a general recursive algorithm to interpolate given set data with rational function. While many algorithms this kind already exist, they are either providing non-minimal degree solutions (like Schur algorithm) or exhibit jumps in interpolants (or partial realization, as is called when interpolation at infinity, see Rissanen (SIAM J Control 9(...