Generic method for automatically generating finite-state machines for schedudling from print engine capabilities
November 10, 2015. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesAutomatic duplex control system for a reproduction machine System and method for high quality image reproduction with grayscale image print while store capability Method for scheduling execution of distributed application programs at preset times in an SNA LU 6.2 network environment Optimal test generation for finite state machine models Measurement of performance of an extended finite state machine Network simulation system Methods for sheet scheduling in an imaging system having an endless duplex paper path loop Method and apparatus for improved job stream printing in an electronic printer with various finishing function Printer job recovery of complete or partially complete jobs in an electronic reprographic printing system Finite state-machine employing a content-addressable memory InventorAssigneeApplicationNo. 475003 filed on 06/07/1995US Classes:358/1.13, Emulation or plural modes358/1.1STATIC PRESENTATION PROCESSING (E.G., PROCESSING DATA FOR PRINTER, ETC.)ExaminersPrimary: Coles, Sr., Edward L.Assistant: Popovici, Dov Attorney, Agent or FirmInternational ClassesG06K 015/00701-712 551-560 AbstractA system is provided for automatically analyzing timing constraints of capabilities, and establishing parameters for automatic generation of finite-state machines which schedule from print engine capabilities. The system generates a finite-state machine which encodes, for each capability, a means by which any given schedule may be extended to one that includes a correct or optimal schedule for that particular capability. The system generates finite-state machines for both forward and backwards scheduling. It is adapted for both greedy and optimal search strategies. The system facilitates selectively leaving classes of constraints for run-time checking in order to reduce a size of a finite-state machine. Finite machines so generated are suitably used with schedulers to alternately control operation of a print engine.Other References
| |
