Question 1: Is there a classification of finite ordered semigroups (or monoids) with $n$ elements for small $n$? Is there computer algebra software that can generate those algebraic objects?
(Here I mean ordered in the sense of https://en.wikipedia.org/wiki/Ordered_semigroup )
Question 2: Is there a classification of finite ordered semigroups (or monoids) whose underlying poset $P$ is fixed? For example $P$ being a totally ordered chain or a Boolean lattice might be interesting.
Question 3: Is there such a classification as in question 2 at least for the much smaller class of inverse semigroups (or monoids) with their natural order? For example can one classify when the underlying poset is connected or a chain in a nice way or give even an explicit classification in the chain case?