Multirelations with infinite computations

被引：6

作者：

Guttmann, Walter ^{[1
]}

机构：

[1] Univ Canterbury, Dept Comp Sci & Software Engn, Christchurch, New Zealand

来源：

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING | 2014年 / 83卷 / 02期

关键词：

Approximation order; Median; Multirelations; Program semantics; Relations; RelView; Sequential computations; GENERAL CORRECTNESS; NONDETERMINISM; ALGEBRAS;

D O I：

10.1016/j.jlap.2014.02.008

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 calculating with multirelations and for finding the approximation order. (C) 2014 Elsevier Inc. All rights reserved.

引用

页码：194 / 211

页数：18

共 50 条

[31] The length of infinite time Turing machine computations
Welch, PD
[J]. BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2000, 32 : 129 - 136
[32] Recursion and topology on 2≤ω for possibly infinite computations
Becher, V
Grigorieff, S
[J]. THEORETICAL COMPUTER SCIENCE, 2004, 322 (01) : 85 - 136
[33] A big step from finite to infinite computations
Ancona, Davide
Dagnino, Francesco
Rot, Jurriaan
Zucca, Elena
[J]. SCIENCE OF COMPUTER PROGRAMMING, 2020, 197
[34] MAGNETIC-FIELD COMPUTATIONS BY INFINITE ELEMENTS
KIM, IH
JUNG, HK
LEE, GS
HAHN, SY
[J]. JOURNAL OF APPLIED PHYSICS, 1982, 53 (11) : 8372 - 8374
[35] THE COMPLEXITY OF INFINITE COMPUTATIONS IN MODELS OF SET THEORY
Finkel, Olivier
[J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2009, 5 (04) : 1 - 18
[36] Monadic Maps and Folds for Multirelations in an Allegory
Martin, Clare E.
Curtis, Sharon A.
[J]. UNIFYING THEORIES OF PROGRAMMING, 2010, 5713 : 102 - 121
[37] An algebraic approach to multirelations and their properties
Berghammer, Rudolf
Guttmann, Walter
[J]. JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2017, 88 : 45 - 63
[38] CLASSIFICATION OF COMPUTING MACHINES WITH INFINITE COMPUTATIONS WITH RESPECT TO PARAINCLUSION
SCHMIDTKE, K
[J]. BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1974, 22 (01): : 71 - 77
[39] Numerical computations and mathematical modelling with infinite and infinitesimal numbers
Sergeyev, Yaroslav D.
[J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2009, 29 (1-2) : 177 - 195
[40] KLEENE STAR, SUBEXPONENTIALS WITHOUT CONTRACTION, AND INFINITE COMPUTATIONS
Kuznetsov, S. L.
[J]. SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2021, 18 (02): : 905 - 922

← 1 2 3 4 5 →