Multirelations with infinite computations
نویسندگان
چکیده
منابع مشابه
Multirelations with infinite computations
Multirelations model computations with both angelic and demonic non-determinism. We extend multirelations to represent finite and infinite computations independently. We derive an approximation order for multirelations assuming only that the endless loop is its least element and that the lattice operations are isotone. We use relations, relation algebra and RelView for representing and calculat...
متن کاملInfinite Computations with Random Oracles
We consider the following problem for various infinite time machines. If a real is computable relative to large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent from ZFC for ordinal time machines (OTMs) with and without ordinal parameters and give a positive answer...
متن کاملInfinite Arrays and Infinite Computations
A complete metric ttipology is introduced on the set of :il finite and infinite arrays and the topological properties of the space are studied. In this complete metric topolor,y, infinite arrays are the limits of increasing sequences of finite arrays. The n.>tion of successful infinite derivations in Generalized Context-free Kolam Array Grammars, yielding infinif e arrays, is introduced. This c...
متن کاملWadge Reducibility and Infinite Computations
Introduction Investigation of the infinite behavior of computing devices is of great interest for computer science because many hardware and software concurrent systems (like processors or operating systems) may not terminate. The study of infinite computations is important for several branches of theoretical computer science, including verification and synthesis of reactive computing systems [...
متن کاملPredicate Detection on Infinite Computations
Earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on an infinite computation. In this work we develop theory and associated algorithms for predicate detection in infinite runs. We introduce the concept of d-diagram which is a finite representation of infinite directed graphs....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2014
ISSN: 2352-2208
DOI: 10.1016/j.jlap.2014.02.008