Deciding Equations in the Time Warp Algebra
Official URL
Publisher DOI
Abstract
Join-preserving maps on the discrete time scale ω+, referred to as time warps, have been proposed as graded modalities that can be used to quantify the growth of information in the course of program execution. The set of time warps forms a simple distributive involutive residuated lattice -- called the time warp algebra -- that is equipped with residual operations relevant to potential applications. In this paper, we show that although the time warp algebra generates a variety that lacks the finite model property, it nevertheless has a decidable equational theory. We also describe an implementation of a procedure for deciding equations in this algebra, written in the OCaml programming language, that makes use of the Z3 theorem prover.
Date Issued
2024-01-26
Publication Type
Article
Subject(s)
Language(s)
en
Author(s)
Additional Credits
Journal
Logical methods in computer science
Publisher
Department of Theoretical Computer Science, Technical University of Braunschweig
ISSN
1860-5974
Access(Rights)
open.access