The paper is concerned with algebras whose elements can be used to represent runs of a system, called processes. These algebras, called behaviour algebras, are categories with resp...
Abstract. Several concepts of algebras with solutions of recursive equation systems are compared: CPO-enrichable algebras are proved to be iteration algebras of Z.
We describe which subdirectly irreducible flat algebras arise in the variety generated by an arbitrary class of flat algebras with absorbing bottom element. This is used to give an...
There is a well-known correspondence between varieties of algebras and fully invariant congruences on the appropriate term algebra. A special class of varieties are those which ar...
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operato...
This paper begins the development of a theory of what we will call symplectic alternating algebras. They have arisen in the study of 2-Engel groups but seem also to be of interest...
Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of El...
In this paper, we introduce triangle algebras: a variety of residuated lattices equipped with approximation operators, and with a third angular point u, different from 0
Bart Van Gasse, Chris Cornelis, Glad Deschrijver, ...
Lukasiewicz's infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Lukasiewicz algebra on the unit real interva...
With the rise of XML as a standard for representing business data, XML data warehouses appear as suitable solutions for Web-based decision-support applications. In this context, i...