A coalgebraic approach to non-determinism: Applications to multilattices
Authors / Editors
Research Areas
No matching items found.
Publication Details
Output type: Journal article
Author list: Cabrera IP, Cordero P, Gutierrez G, Martinez J, Ojeda-Aciego M
Publisher: Elsevier
Publication year: 2010
Journal: Information Sciences (0020-0255)
Volume number: 180
Issue number: 22
Start page: 4323
End page: 4335
Number of pages: 13
ISSN: 0020-0255
Languages: English-Great Britain (EN-GB)
Unpaywall Data
Open access status: closed
Abstract
Multilattices are a suitable generalization of lattices which enables to accommodate the formalization of non-deterministic computation; specifically, the algebraic characterization for multilattices provides a formal framework to develop tools in several fields of computer science. On the other hand, the usefulness of coalgebra theory has been increasing in the recent years, and its importance is undeniable. In this paper, somehow mimicking the use of universal algebra, we define a new kind of coalgebras (the ND-coalgebras) that allows to formalize non-determinism, and show that several concepts, widely used in computer science are, indeed, ND-coalgebras. Within this formal context, we study a minimal set-of properties which provides a coalgebraic definition of multilattices. (C) 2010 Elsevier Inc. All rights reserved.
Keywords
Coalgebras, Lattices, Multilattices, Non-determinism
Documents
No matching items found.
