Part I of this paper has shown that a subclass of the finitely recursive processes (FRP), composed without the sequential composition operator (SCO), is bounded. In this sequel it is first shown that boundedness is not guaranteed but decidable for the subclass of FRP built using the SCO, but without the parallel composition operator (PCO), To overcome the limitation in modeling using the SCO only, some bounded hybrid subclasses have been proposed where both the SCO and PCO can be used, although in a restricted fashion, Finally, the proposed hybrid framework is used to model a job-shop, and its potential in the specification and design of supervisory control systems is demonstrated.