A Computational Tool for Some Boolean Partial Maps

Abstract

This work is devoted to constructing a deterministic finite a utomaton whose states are particular types of order-preserving Boolean partial maps introduced by Bisi and Chiaselotti. The domains of such maps are subsets of a finite poset equipped wi th an idempotent and antitone map. These maps can be identified wit h certain linear systems of real inequalities and this autom aton provides a computational model useful for building the global extensions of such maps.