On the structure of demonic refinement algebras with enabledness and termination

被引：0
|
作者：
De Carufel, Jean-Lou [1 ]
Desharnais, Jules [1 ]
机构：
[1] Univ Laval, Dept Informat & Genie Log, Quebec City, PQ G1V 0A6, Canada
来源：
RELATIONS AND KLEENE ALGEBRA IN COMPUTER SCIENCE | 2008年 / 4988卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The main result of this paper is that every demonic refinement algebra with enabledness and termination is isomorphic to an algebra of ordered pairs of elements of a Kleene algebra with domain and with a divergence operator satisfying a mild condition. Divergence is an operator producing a test interpreted as the set of states from which nontermination may occur.
引用
收藏
页码：69 / 83
页数：15
相关论文
共 50 条
  • [1] Enabledness and termination in refinement algebra
    Solin, Kim
    von Wright, Joakim
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 2009, 74 (08) : 654 - 668
  • [2] Refinement algebra with operators for enabledness and termination
    Solin, Kim
    von Wright, Joakim
    [J]. MATHEMATICS OF PROGRAM CONSTRUCTION, 2006, 4014 : 397 - 415
  • [3] Abstract representation theorems for demonic refinement algebras
    De Carufel, Jean-Lou
    Desharnais, Jules
    [J]. JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2010, 79 (08): : 740 - 767
  • [4] Relational Demonic Fuzzy Refinement
    Tchier, Fairouz
    [J]. JOURNAL OF APPLIED MATHEMATICS, 2014,
  • [5] Finite representability of semigroups with demonic refinement
    Hirsch, Robin
    Semrl, Jas
    [J]. ALGEBRA UNIVERSALIS, 2021, 82 (02)
  • [6] Finite representability of semigroups with demonic refinement
    Robin Hirsch
    Jaš Šemrl
    [J]. Algebra universalis, 2021, 82
  • [7] Omega algebra, demonic refinement algebra and commands
    Hoefner, Peter
    Moeller, Bernhard
    Solin, Kim
    [J]. RELATIONS AND KLEENE ALGEBRA IN COMPUTER SCIENCE, PROCEEDINGS, 2006, 4136 : 222 - 234
  • [8] Abstraction refinement for termination
    Cook, B
    Podelski, A
    Rybalchenko, A
    [J]. STATIC ANALYSIS, PROCEEDINGS, 2005, 3672 : 87 - 101
  • [9] Almost-Sure Termination by Guarded Refinement
    Gregersen, Simon Oddershede
    Aguirre, Alejandro
    Haselwarter, Philipp G.
    Tassarotti, Joseph
    Birkedal, Lars
    [J]. PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2024, 8 (ICFP): : 203 - 233
  • [10] On two dually nondeterministic refinement algebras
    Solin, Kim
    [J]. RELATIONS AND KLEENE ALGEBRA IN COMPUTER SCIENCE, PROCEEDINGS, 2006, 4136 : 373 - 387
12345