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 …

Logic has proved essential for formally modeling software based systems. Such formal
descriptions, frequently called specifications, have served not only as requirements …

Algebraization of computational logics in the theory of fork algebras has been a research
topic for a while. This research allowed us to interpret classical first-order logic, several …

Describing systems through the specification of different views is a well accepted practice in
modern software engineering. In this paper we show how to reason across behavioral …

Fork algebras are an extension of relation algebras obtained by extending the set of logical
symbols with a binary operator called fork. This class of algebras was introduced by …

The world of software development has become intrinsically heterogeneous. Many formal
languages have been made available to help analysts and designers model different …

In previous articles we presented A rg entum, a tool for reasoning across heterogeneous
specifications based on the language of fork algebras. A rg entum's foundations were …

La descripción de sistemas mediante distintas vistas es una práctica aceptada en la
ingeniería de software moderna. En este trabajo, mostramos como es posible razonar en un …

Las lógicas han sido usadas como sistemas formales para especificar sistemas de software.
Más aun, las especificaciones lógicas, por ser formales, contribuyen en la aplicación de …