Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
432109 | The Journal of Logic and Algebraic Programming | 2006 | 24 Pages |
Abstract
In this paper we prove theorems on the interpretability of the first-order temporal logics LTL and TL into Fork Algebras. This result is part of a research project on the interpretability of logics in Fork Algebras, and has important applications towards the relational specification of properties of systems within the Argentum tool.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics