EP0505092A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Switch control methods and apparatus
Assignee: AT&T Inc
•
Filing: 1992-03-12
•
Granted: —
•
Expires: 2012-03-12
Abstract
Abstract A system for employing a computer to control a device to provide a plurality of services (207) for a plurality of entities (205). Each entity corresponds to exactly one of the services and each service has its own copy (213) of the code which defines the service. The system associates a process (113) 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. The finite state machine is defined by a special language, the service logic language, and the decision graphs are defined by means of a graphical editor. The compiler for the service logic language produces not only C++ code defining the finite state machine, but also data base and shell scripts which are used to provision and maintain the services. An embodiment of the system is disclosed which is used in a service node of a telephone switching network to provide telephone services such as 800 number service, caller ID, and the like.
Inventors
- 👤 Brian George Beuning
- 👤 Seymour Bloom
- 👤 Ryamond Eugene Bright, Jr.
- 👤 Steven Lloyd Greenspan
- 👤 Joel M. Marks
- 👤 Michael James Morgan
- 👤 Timothy Jerome Scale
- 👤 Bruce Fat Wong
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-29 21:08
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/42; H04Q3/54; H04Q3/545; H04Q3/54508; H04Q3/54525; H04Q3/0016; H04Q3/0029; H04Q3/54575; H04Q3/54583; H04Q2213/00; H04Q2213/1305; H04Q2213/13057; H04Q2213/135; H04Q2213/13501; H04Q2213/13503; H04Q2213/13512; H04Q2213/13515; H04Q2213/13527
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
92 words
Apparatus for controlling a device (105) by means of a computer (103) to provide a plurality of services employing the device for a plurality of entities, the apparatus CHARACTERIZED BY: means (201) for establishing a correspondence between entities and services such that each entity corresponds to only one service; for each service, a copy (213) of the complete code required to define the service; and means responsive to an identifier for an entity for causing the computer to execute the copy of the code for the service to which the entity corresponds.
Claim 2
Dependent Claim
63 words
The apparatus set forth in claim 1 further CHARACTERIZED IN THAT: there is further a service process ( 113) corresponding to each service which, when run, causes the computer to execute the copy of the code for the service; and the means responsive to an identifier for an entity causes the process corresponding to the service to which the entity corresponds to run.
Claim 3
Dependent Claim
63 words
The apparatus set forth in claim 2 further CHARACTERIZED IN THAT: the service process is a first process (701) and a second process (703); and the first process and the second process cooperate to execute the copy of the code for the service in response to event messages (108) including an event message from the means responsive to the identifier for the entity.
Claim 4
Dependent Claim
40 words
The apparatus set forth in claim 3 further CHARACTERIZED IN THAT: the first process executes a first part (1407) of the copy of the code and the second process executes a second part (1049) of the copy of the code.
Claim 5
Dependent Claim
43 words
The apparatus set forth in claim 3 further CHARACTERIZED IN THAT: to a decision graph (221) which is part of the data (215) associated with the first process; and the first process commences traversal of the decision graph in response to the reference.
Claim 6
Dependent Claim
73 words
The apparatus set forth in claim 5 further CHARACTERIZED IN THAT: the first part of the copy of the code defines a finite state machine which is implemented by the first process; and the decision graph is specified using a graphical interface (2001); the finite state machine is specified using a finite state machine language (1501); and the second part of the copy of the code is specified using a general-purpose programming language.
Claim 7
Dependent Claim
69 words
The apparatus set forth in claim 3 further CHARACTERIZED IN THAT: the apparatus further includes a device handler (110) for the device; and the event messages further include event messages from the device handler and from the first and second processes; and the second process responds to event messages from the device handler and the first process and the first process responds to event messages from the second process.
Claim 8
Dependent Claim
38 words
The apparatus set forth in claim 7 further CHARACTERIZED IN THAT: the apparatus further includes an administration process (115) for administering the services; and the first process and the administration process cooperate by means of further event messages.
Claim 9
Dependent Claim
94 words
The apparatus set forth in claim 2 further CHARACTERIZED IN THAT: the service process executes the copy of the code in response to typed event messages including an event message from the means responsive to the identifier for the entity; the service process implements a finite state machine wherein types of event messages are associated with states of the finite state machine; and the service process responds to an event message of a given type when the finite state machine is in the state with which event messages of the given type are associated.
Claim 10
Dependent Claim
65 words
The apparatus set forth in claim 9 further CHARACTERIZED IN THAT: a decision graph is associated with the service process and may be traversed by the process in the course of executing the copy of the code; and traversal of the decision graph associated with the service process results in the generation of an event message of a type to which the service process responds.
Claim 11
Dependent Claim
46 words
The apparatus set forth in claim 10 further CHARACTERIZED IN THAT: the decision graph includes a user-defined node; and the event message of the type to which the service process responds is generated in response to a traversal by the service process of the user-defined node.
Claim 12
Dependent Claim
81 words
The apparatus set forth in claim 2 further CHARACTERIZED IN THAT: in executing the copy of the code for the service to which the entity corresponds, the service process employs service data including global data available to all entities corresponding to the service, per-entity data available only to the entity for which the service process is currently executing the copy of the code; and per-execution data which is available only to the entity and only for that execution of the code.
Claim 13
Dependent Claim
74 words
The apparatus set forth in claim 12 further CHARACTERIZED IN THAT: the apparatus includes a service data loading process for providing updates of portions of the non-per-execution service data to the service process; and the code executed by the service process includes service data loading code for loading the updates provided by the service data loading process into the service data, whereby the service data may be updated while the service process is running.
Claim 14
Independent Claim
36 words
The apparatus set forth in any of claims 1 through 13 further CHARACTERIZED IN THAT: the device controlled by the computer is a telephone switching system; and the identifier for the entity is a telephone number.
Claim 15
Dependent Claim
92 words
A compiler for translating a specification into code, the compiler being CHARACTERIZED IN THAT: the signification (1701) is a specification written in a single language which describes a system which is implemented using a plurality of subsystems; there is a plurality of languages for writing code controlling the subsystems, each subsystem being controlled by code in a language of the plurality of languages; and the compiler translates the single specification into code (1705) for the subsystems, the code for each subsystem being in the language which is used to control that subsystem.
Claim 16
Dependent Claim
56 words
The compiler set forth in claim 15 further CHARACTERIZED IN THAT: the specification describes a service implemented in a telephone switching system; and the subsystems include at least a subsystem for controlling a telephone switch to handle calls as required by the service and a subsystem for provisioning the telephone switch as required by the service.
Claim 17
Dependent Claim
39 words
The compiler set forth in claim 16 further CHARACTERIZED IN THAT: the subsystems further include a subsystem for preparing bills for the service; a subsystem for measuring the use of the service; and a subsystem for auditing the switch.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.