Abstract: A system for employing a computer to control a device to provide a plurality of services for a plurality of entities. Each entity corresponds to exactly one of the services and each service has its own copy of the code which defines the service. The system associates a process which executes the service with each service. The code for a service defines a finite state machine which is continually executed by the service's process. While in a given state, the finite state machine may traverse a decision graph which is directly accessible to the process. Actions to be taken on traversal of a node of the decision graph may be defined in the finite state machine. The service's process communicates with other processes and with itself by means of interprocess messages. Each state of the finite state machine contains event handlers for responding to messages received by the service's process.

Abstract: A call processing embodiment where customers are offered, in addition to the conventional office dialing plan, a special dialing plan where received numbers are processed such that a query of a database is defined when a prespecified access code, e.g., *66, is received, for example followed by a destination number, but where call blocking is defined for a predefined plurality of destination numbers, e.g., all destination numbers beginning with 976 or 1-900 or all destination numbers beginning with 1, when such numbers are received without the prespecified access code. Illustratively, the database query may result in the customer being prompted for a personal identification number (PIN) and accordingly 976 or 1-900 access is thereby limited to those knowing the PIN. The database may perform other call screening and call management operations such as time of day or day of week screening or limiting the number or cost of 976 calls in a given time period.