[go: up one dir, main page]

EP0559605B1 - Système d'identification de personnes - Google Patents

Système d'identification de personnes Download PDF

Info

Publication number
EP0559605B1
EP0559605B1 EP93810084A EP93810084A EP0559605B1 EP 0559605 B1 EP0559605 B1 EP 0559605B1 EP 93810084 A EP93810084 A EP 93810084A EP 93810084 A EP93810084 A EP 93810084A EP 0559605 B1 EP0559605 B1 EP 0559605B1
Authority
EP
European Patent Office
Prior art keywords
units
identification
control
unit
person
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP93810084A
Other languages
German (de)
English (en)
Other versions
EP0559605A2 (fr
EP0559605A3 (en
Inventor
Carlo Hächler
Johann K. Locher
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bauer Kaba AG
Original Assignee
Bauer Kaba AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Bauer Kaba AG filed Critical Bauer Kaba AG
Publication of EP0559605A2 publication Critical patent/EP0559605A2/fr
Publication of EP0559605A3 publication Critical patent/EP0559605A3/de
Application granted granted Critical
Publication of EP0559605B1 publication Critical patent/EP0559605B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C1/00—Registering, indicating or recording the time of events or elapsed time, e.g. time-recorders for work people
    • G07C1/10—Registering, indicating or recording the time of events or elapsed time, e.g. time-recorders for work people together with the recording, indicating or registering of other data, e.g. of signs of identity
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C9/00—Individual registration on entry or exit
    • G07C9/20—Individual registration on entry or exit involving the use of a pass
    • G07C9/27—Individual registration on entry or exit involving the use of a pass with central registration
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C9/00—Individual registration on entry or exit
    • G07C9/20—Individual registration on entry or exit involving the use of a pass
    • G07C9/28—Individual registration on entry or exit involving the use of a pass the pass enabling tracking or indicating presence

Definitions

  • the invention relates to a system and a method according to the preamble of claim 1 or claim 13 for identifying persons and for controlling and controlling the access of persons to objects with the persons associated with the persons and carried by the persons carrying units, with the objects associated with object units and Control elements, each object unit is assigned a control element for controlling the interaction between carrier units and object units, wherein between the carrier units with each other no direct connection and wherein there is no direct connection between the object units with each other.
  • Previously known such identification and access systems are geared and limited to very specific tasks or functions on a particular type of object.
  • a known system with data carrier cards as a ticket and means of payment does not have these inventive features.
  • This known system with portable readers for the data carrier cards and IR data transmission to an evaluation terminal is applicable only for a very specific task: it is entered a desired destination, calculated the fare and deducted from the amount stored on the card money for driving authorization.
  • Person identification with technical aids usually aims at access or access authorization in closed or controlled areas. But it is also possible to extend this control (identification) to other functions, such as presence control, triggering of functions or automatic data transfer and so on.
  • IDs for certain authorizations (access or access) which are carried by the authorized persons, are usually issued.
  • the most well-known example is probably the plastic card with magnetic stripe or built-in chip or otherwise a readable code
  • the most current problem is the ever-increasing variety that has to be used by such technical aids that carry a person and in certain situations in a certain way , arises.
  • the basis for implementing such a project is a modular combination of a personal first unit or carrier unit with transmitting / receiving memory means interacting via an antenna, which unit works alone or together with another unit with an additional but different identification part, as well as one non-person-but object-related second unit or object unit for the interaction between person and object and also with control elements as means for controlling and maintaining the interaction with which the units, carriers and objects are networked online and offline.
  • the carriers communicate with each other, if at all, only via an object or via an evaluation stage. This means that the interactions are strictly parallelized and a networking of individual objects or carriers occurs only via an organizational unit (evaluation level or control level). This allows a very flexible person identification on fixed and mobile objects with a variety of location-independent carriers for a variety of functions. This is a relatively complex, controllable, highly complex, expandable system.
  • a closed system means a defined group of objects or object units O (all doors of a building, facilities and equipment of this building, all buses and trams of a city, as well as the infrastructure for such a public transport with facilities, devices, control computers etc All control locations of a monitoring team (Securitas etc.) with associated control elements K , on which an indefinite number carrier or carrier units T act, which system but other objects can be associated with control elements, which are recorded in the closed information system so to speak.
  • objects or object units O all doors of a building, facilities and equipment of this building, all buses and trams of a city, as well as the infrastructure for such a public transport with facilities, devices, control computers etc All control locations of a monitoring team (Securitas etc.) with associated control elements K , on which an indefinite number carrier or carrier units T act, which system but other objects can be associated with control elements, which are recorded in the closed information system so to speak.
  • Such a closed system is virtually connected by a common basic data record or data structure (basic sentence, basic structure, hereinafter referred to as gene set).
  • the objects with their control elements can be geographically dispersed and / or mobile.
  • System cohesion does not require a physically ordered backbone (eg network backbone like Ethernet), only the common base dataset that creates and propagates the genus of the system is needed.
  • the carrier units indeterminate in number, may or may not affect the objects or object units, they are not systemically related in fixed relation, they are free system elements.
  • System elements are thus: T's, the carrier units, O's, the object units and K's, the control elements, where O's and K's with the basic data set (gene set) as solid system elements form the system genus, which includes the free system elements, the carrier units or even persons , like a loose, cloud-like structure are assigned.
  • T's, O's and K's are elements and form cells (Tx, Kx, Ox), which cells are the basic building blocks in the system.
  • Each cell element (Tx, Kx, Ox) interacts with any number of elements of another cell (Ty, Ky, Oy); the T's with any number of O's and the O's with any number of T's and the K's with any number of K's of other cells. Looking at such a cell in cross-linking or interacting with other cells, one recognizes that through the T -> O asymmetry, the O's are valleys and the T's are sources.
  • the K's are comparable to oscillators, since they can be the only cell element in a symmetrical connection (interaction) with other K's (for the purpose of information exchange). Furthermore, it will be seen that each K of its own cell protects or immunizes it against external changes (the gene set).
  • the cell's own K prevents the O of the cell from being altered by any interaction of a T (other than that controlled by K). This provides a protected cell autonomy (the cell has its own set of information, which assigns that cell a specific place in the system).
  • the elements of a cell are usually only "organizational" in contact with each other, they can be far apart from each other. They contain an inherent order which propagates across them when two or more cells interact. In every interaction, order is created or order is accomplished. This image is comparable to a clan (family), whose togetherness is the inherent order and their interaction, for example, the effect of the message of the 100th birthday of the great-grandmother, the family members from around the world brings together in a common place (completed order).
  • Tz contains a code element which is supposed to change (temporarily) in Ox (time window); then this code element only works over the K backbone. For example.
  • This "gene set” corresponds to the lowest intelligence level of the system and as such creates a virtual backbone that operates from K to K without a direct connection (ie offline). Thus, the system holds this assumption and allows it to operate in a basic mode that does not require any special attention or activity.
  • a higher intelligence is accomplished by a "brain set” that can be entered into the K's and functionally extends the system. This higher intelligence requires more communication and thus a direct connection (online) between the K's, which however does not have to be permanently present.
  • a direct connection means a cable connection (also modem / telephone) and / or wireless connection via radio.
  • FIG. 1 shows the interaction mechanism between three carriers T1, T2, T3, with three objects 01, 02, 03, and three control elements K1, K2, K3, in the said manner.
  • the T's form a carrier plane Tn
  • the O's form an object plane On
  • the K's a control plane Kn.
  • an each-to-every plane F1 forms and between the object plane and the control plane there is a fixed mapping plane F2 which actually passes through the coupling to the backbone is created.
  • the objects are bound in a direct relationship to their control elements.
  • T1, O1, K1 form a cell.
  • T1 is assigned to 01, for example office key, flat key, safe admission etc. and K1 directly controls the object 01.
  • T1 can act on the object O1, T1 can also act on the control element K1. K1 can turn on O1 and T1. T1 can also act on all other O's while O1 can only affect K1. K1 can affect the other K's, but not the other O's or T's. For example, T1 can not act directly on T3 (upper arrow crossed out with X), T1 can only act on T3 via K1, K2, K3 (backbone) (dashed arrow below). The system is expandable in the direction of Tn, On, Kn, but it is closed to information from the outside.
  • T1, O1, K1 interacting with T's, O's and K's. It can be seen from the direction of the arrows that the T's, like sources and the O's, behave like sinks in terms of information acquisition and delivery.
  • the K's engage with other K's interactions and, according to the terminology just used, behave like oscillators between which information travels back and forth.
  • the T's may act on a particular Ox object, with the associated Kx sensing that action and deciding (eg, according to the gene set of the acting T's) whether information from that T or its action is related to another K and from there to an associated one Object or associated carrier is supplied.
  • This "authorized" T is thus temporarily comparable to a T *, which is dyed colored with a T, a T, which is given (temporarily) an approval information by Kx .
  • the staining or highlighting of such a T can be actively withdrawn or it can go out by itself after a certain time.
  • FIG. 4 now shows four cells 1, 2, 3, 4 with the cell elements T, O, K interacting via T1, that is to say via the carrier of cell 1, which acts on the O's, that is, the objects of the other cells, For example, bearer of an identification with which, for example, by the closure of the objects 1 to 4 is allowed.
  • Each of these objects is under the control of the associated K, which contains a basic data set (the gene set).
  • T1 can not respond to any of these O's Actively, none of these O's can act on T1 actively.
  • Mutual exposure is only possible via the cell's own K. The following figures show how this is done in the following Figures 5, 6 and 7.
  • FIG. 5 shows a part, the T1 of a cell 1 and a complete cell 2, of which both carriers T1 and T2 act on the object O2 of the cell 2.
  • This figure is intended to show how interactions of cells form so-called meshes.
  • the object of the cell 2 is connected to the control element K2 associated with the cell.
  • the K's are by definition interconnectable.
  • K2 of the cell is also connected to the K1 of the other cell, which is shown on the left side of the figure.
  • K2 is shown once within its cell and a second time (the same K2! As part of a mesh where it is connected to K1.
  • the elements K1, K2 with T1 and O2 together form the smallest possible mesh, an elementary mesh.
  • a mesh has a "diode” and a feedback path through the elements K, and only one cell (primitive or unit cell) and one mesh, which need not be an elementary mesh, can actively act on an object (eg, a locking device O2). which are modified by the carrier T2 and by the control element K2 or (by consensus) of any K in the mesh, eg pin code or password change).
  • Mesh thus forms through the connections between control elements.
  • An elementary pocket is formed by two adjacent cells.
  • Figure 6 shows the extension from an elementary mesh formed by adjacent cells to a general mesh formed by non-adjacent cells, from a cell 5 to the object O5, and the cell 1 to the carrier T1, both cells interacting with the supports T1 and T5 are above the object 05.
  • the stitch now extends from about O5 K5 ... K 1 to T1 and the route K5 ... K1, the cell 3, the part of the route K3 is, figuratively, quasi docked, or incorporated.
  • FIG. 7 shows a virtual backbone ranging from Ko to Kn.
  • K organizationally (not locally) ordered control elements K, on which the cells abut or are integrated, and which cells arbitrarily form meshes via the backbone.
  • a 1.3-mesh between the cells 1 and 3 is shown here, it can also be 2.7-mesh or 8.12 mesh, short x, y-mesh.
  • the organization rule for the K's of a backbone is: docked or integrated cells (bound cells) can effect only two interactions on objects, namely via the cell to the own object and via meshes on foreign objects.
  • the backbone is the root intelligence, the set of genes defined, each K has a set of basic functions that are virtually (organizational) interconnected and can be superimposed on a higher level of intelligence. This superimposed intelligence forms the brain set.
  • the gene set corresponds to the lowest intelligence level of the system and is imprinted on the backbone via the K's. It works without electrical interconnection, it works offline (stand alone).
  • the Brain set however, needed more communication, it can span the whole backbone or just parts of it, it works online.
  • FIG. 8 shows, as a transition to the scenarios described below, the relationship (interaction) of two persons 1 and 2, their associated objects 1 and 2 and the associated control elements 1 and 2 in the carrier, object and control plane.
  • This representation facilitates the understanding of application and in particular supports the image of the backbone, since now all K's are arranged in a common plane.
  • T-plane In the T-plane are two persons T1 and T2, both of which can act on the two objects 01 and 02 of the object plane, the doors 1 and 2, which are monitored by the two control elements K1 and K2.
  • These two K's are part of a backbone that continues to breed.
  • the two K's are indirectly (offline) connected to each other by a gene set and can also be connected directly (online) by a brain set.
  • a cell with memory contains, for example, relationship data, admission data, time window and so on, ie the static or better invariant part of the system and a cell with processor (and memory) processes the fixed data with occurrences and processes, ie the dynamic or variable part of the system system.
  • FIG. 9 shows, based on FIG. 8, a first scenario.
  • a cell 1 and a cell 2 is represented by one person each (T1, T2), the identification means, a key for person 1 and a chip card for person 2.
  • the associated doors (01.02) are connected through an online Backbone segment K1, K2 controlled.
  • the approval from T2 to O1 is fixed and needs no action, it is part of the gene set information.
  • the message from K1 to K2 that T2 is in O1 and the action of K2 to 02, namely to lock the door, since the office is unoccupied, is situationally regulated and requires an active intervention. This time-dependent action is a matter of the Brainsets and is accomplished technically for example.
  • transmitter / transponder means With transmitter / transponder means and over a K1-K2 connection (wire, modem, radio etc.).
  • the key of person 1 and the smart card of person 2 both have transmitting means and the objects associated with the backbone segments K1, K2, equivalent to the control elements K1, K2, respond accordingly on the basis of the genset and brainset information the time-independent and time-dependent features or functions.
  • FIG. 10 shows in parts A, B and C two possible implementations of a backbone.
  • the backbone is an (organizational or physical) linear chain of segments ... K1 ..// .. K4 ... through which, for example, an information 11 of T1 passes through all K's to 04 (serial backbone ). All T's act on the cell K corresponding segment of such backbone and from there on other control elements with Ae shoredserlaubnis to the O's (or directly to all O's, is excluded because of omission of control points K Ae shore shored).
  • the backbone (organizational or physical) is emulated by a central processing unit Z.
  • An information I1 of T1 passes through the central unit Z via the segment K4 to the object 04 (emulated backbone).
  • the control elements are interconnected via the central computer, which performs the backbone function. All T's act instead of the corresponding K on the central unit Z, which represents the backbone and also the control point of the own cell for the T's.
  • Part C of FIG. 10 shows a mixed form of the two "arrangements", whereby, as will be explained below, so-called control clusters are formed can be realized, which are realized by a subordinate computer.
  • FIG 11 now shows a specific scenario, namely the use of a control cluster.
  • the control cluster functions like a sub-central unit with backbone emulation (for example a group with the same gene set), which is connected to a central unit and leads to a relief of this central unit by the connection of such clusters.
  • a control cluster can be compared to another backbone managed by a central processing unit.
  • a central processing unit can control a plurality of backbones.
  • the backbone is a decentralized system unit whose parts or elements can be located in different locations and are organizationally ordered offline by the gene set and strictly ordered online by the brain set.
  • control units of mobile objects as here in a car fleet with an arbitrarily large number of vehicles. Simplified here are only two vehicles and a dispatcher office represented as objects, also this 3-er scenario is still grouped into a cluster, which is connected to a main control unit Z main .
  • K 3 Z sub
  • Z is sub a control cluster, as well as a central unit Z main involved.
  • K1-K2 are indirectly linked by a gene set, K1 with K3 and K2 with K3 directly (via radio) through a brain set.
  • K3 which of course also has a gene set, is connected via a brain set with a Kx and Z main .
  • Z main may be connected to other control clusters, as indicated by a double-headed arrow pointing to the word cluster.
  • T2 a chauffeur for special operations, fails and must be replaced by T1, an equivalent chauffeur.
  • T1 has to be subtracted from O1 and allocated to O2.
  • the dispatcher T3 must regulate this new deployment (via K3), replacement for T2 (in reality for T1) is sought.
  • T2 in reality for T1
  • the Brain Set will change the "Replacement for T2 Replaced T1" bet. This shows that this scenario can not be regulated by the gene set alone.
  • K1, K2 and K3 form the backbone and at the same time a cluster Z sub which is connected to a higher-order unit Z main .
  • Figures 12 and 13 show a concrete.
  • the programming device for programming a personal identification chip (such chips may be on cards, keys, or any other item carried by any Tx ) should be used.
  • the use includes reading and / or programming chips.
  • the programming device Op is a single device, it contains next to an authorization reader and a read / write station, a control point Kp which via a common electrical interface with another control point K (K, for example, a master computer in the backbone over which brain set information is distributed ) online or stand alone.
  • K for example, a master computer in the backbone over which brain set information is distributed
  • the stand alone connection is realized by the gene set in Kp , the online connection serves to superimpose the brain set.
  • the individual usage types are subdivided into differently protected hierarchies (levels).
  • the identification for the use ie the authorization to operate the read / write station, proceeds as follows.
  • the user Tp to be authorized identifies himself to the authorization reader with an authorization card (reason, cards can be labeled for organizational purposes).
  • the active use of the chip programmer is only possible under permanent read communication of the authorization card, the authorization reader may only read. During active reading, the card in the recording unit is kept controlled. If the authorization card is removed, the read / write station can no longer be operated.
  • the authorized user who, by programming in the programmer gene sets and other data in other chips for a plurality Tx, for example, the keys of an entire factory to be programmed, is a Tp user, similar to the office owner, Bus 107ur in the other scenarios.
  • Tp, Op, Kp a cell which is connected via the interface with the backbone, on which the intelligence outflowing cell (T1, O1, K1) with the control computer Ol with its control unit K1 and the Operator Tl is connected.
  • Tp is now able to get from Ol the data, with which he, of course, under control of the backbone, any number of chips from Tx to program, so gene sets and brain sets to save it.
  • Tx for example, keys in a factory, can then act on the objects Ox , the doors of the factory, which then belong to the same backbone and thus have the same gene. On other objects (another factory) the influence of such Tx is ineffective. This shows that the programming cell and the host cell must belong to the same system as the many user cells formed by key carriers, doors and control points.
  • a gene set for the system discussed above may look as follows: access authorization, master data for upload, master data for download, terminal identification, badge definition, user level.
  • a brain set can then contain the following data. Time / coming, time / walk, operation, parameter upload, parameterization start / end and enable / disable, diagnosis start / end, data repeat / delete, switch online, switch offline, switch autonomously, set time / date, master records download / delete / request / download end and other configuration measures.
  • An access control system that considers three basic elements of "carrier-object control" as one integrated whole instead of just one function to be isolated in isolation.
  • a control system combines these three parts in the form of system-integrated building management, taking into account dependencies, overlaps and similarities.
  • the control system is thus able to events out to connect the access control or time recording, for example, with an action in the building automation.
  • the system is used to secure rooms, areas, test sites, research laboratories, computer centers, etc.
  • the person in the access control system is bearer of a passport T with access and access data such as access, authorization, residence to or at the object O, passport reader, which are distributed in or in the building or on a plant, machine etc.
  • the access control which is to be understood spatially, the access control, which is to be understood operationally, for example, access to the programming device for the access control system or to certain computer equipment, their data and information.
  • the gene set of such a system includes, for example, personal master data, access profiles, authorization of ID cards, access levels, access zones.
  • the brain set includes, for example, variable door opening times, variable door monitoring time, only ID card or ID card with secret code, time zones, time zone access levels, entry / exit control, double entry lock, stay control and the like. These functions can, for example, be entered and / or changed via a PC.
  • the distribution of this information to the controls is accomplished online through the backbone.
  • the cells (Tx, Ox, Kx) thus formed are, for example, room cells (offices, laboratories, workshops), device authorization cells (computer equipment, control computer cell, programming devices, data readers, machines), zone cells (floors, room groups), and so forth in which cells the O's are the sinks and the T's are the sources (each T can act on each O, with the associated K checking access or admission from the sets).
  • Each object, the card reader on doors, devices, machines is integrated into the organization by the stored gene set off line and connected via online connection with one or more computers, for example, clusters. These connections are usually through a standardized interface how RS-232 is realized in PC's and can be connected to each other via lines or radio.
  • a large number of access and approval control devices O are installed in a building. They can be influenced by chip cards, chip keys or other objects T which have a chip capable of communication.
  • the control devices are card readers, locking cylinders with reading device, receivers that can record and evaluate a signal originating from a T object.
  • the control devices have assigned to them control elements K, in which the gene set is stored, as it is stored in mobile storage of the T elements.
  • the whole building has (in terms of the system the memories of the control elements K and the mobile elements T) in a first level a basic data set which is divided into a second level in groups, for example in floors. In further levels, the basic data set can be grouped even more. That's the invariant data.
  • the brain set can be superimposed online via the backbone, through which the variable data is communicated to the control elements. From these control elements, it is possible to influence the T elements via the objects (for example controller K, card reader / writer O for a chip card or electronics center K, lock cylinder O for a chip key), but only via the own K element.
  • a remote reading is done by amplifying the emitted signals of a T-element by means of a booster as described by the same Applicant in European Patent Application EP-A-0'448'507.

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Lock And Its Accessories (AREA)
  • Radar Systems Or Details Thereof (AREA)
  • Telephonic Communication Services (AREA)
  • Air Conditioning Control Device (AREA)
  • Time Recorders, Dirve Recorders, Access Control (AREA)
  • Alarm Systems (AREA)
  • Devices For Checking Fares Or Tickets At Control Points (AREA)
  • Burglar Alarm Systems (AREA)

Claims (15)

  1. Système d'identification de personnes et de contrôle et commande de l'accès de personnes à des objets, avec des unités de support (T) associées aux personnes et portées par les personnes, avec des unités d'objet (O) associées aux objets, et avec des éléments de contrôle (K), un élément de contrôle (K) étant associé à chaque unité d'objet (O) en vue de contrôler l'interaction entre les unités de support (T) et les unités d'objet (O), aucune liaison directe n'existant entre les unités de support (T) et aucune liaison directe n'existant entre les unités d'objet (O), caractérisé
    en ce que les éléments de contrôle (K) du système comportent un jeu de données de base commun contenant des données de base relatives aux unités de support (T) et aux unités d'objet (O),
    en ce qu'il existe une liaison de communication bidirectionnelle entre les éléments de contrôle (K),
    en ce que des liaisons unidirectionnelles sont réalisées depuis les unités de support (T) vers les unités d'objet (O), aucune information ne pouvant circuler depuis les unités d'objet (O) vers les unités de support (T),
    et en ce que des liaisons bidirectionnelles sont réalisées entre des éléments de contrôle (K) et des unités de support (T) sélectionnées, ainsi qu'entre des éléments de contrôle (K) et des unités d'objet (O) sélectionnées.
  2. Système selon la revendication 1, caractérisé en ce que les unités de support (T) sont réalisées sous forme orientée support, portable et non fixe en coordonnées, et les unités d'objet (O) sont orientées en lieu et se situent dans des lieux fixes, tels que des portes dans des bâtiments, elles sont donc agencées de manière fixe en coordonnées ou fixe sur des objets mobiles, tels que des véhicules, et sont donc fixes en objet, et en ce qu'à chaque unité d'objet (O) est associé un élément de contrôle (K) pour le contrôle et le maintien de l'interaction entre des unités de support et des unités d'objet, ce qui empêche qu'une action modifiant des données se produise depuis une unité d'objet vers une unité de support.
  3. Système selon la revendication 2, caractérisé en ce qu'à chaque élément de contrôle (K) du système est associé un jeu de données commun contenant des données de base relatives aux unités de support (T) et aux unités d'objet (O) et il se forme ainsi un réseau virtuel à liaison indirecte.
  4. Système selon la revendication 3, caractérisé en ce que des liaisons en ligne d'un élément de contrôle (Kx) vers un élément de contrôle (Ky) sont prévues entre des éléments de contrôle (K) du système, en vue d'introduire d'autres données dans leur mémoire, et en ce qu'il se forme ainsi un réseau à liaison directe.
  5. Système selon les revendications 3 et 4, caractérisé en ce que des jeux de données étendus (brain-set) sont également mémorisés au choix dans des unités de support (T) en plus du jeu de données de base (gen-set) commun.
  6. Système selon les revendications 3 et 4, caractérisé en ce qu'il est établi simultanément des réseaux virtuels par le jeu de données de base et des réseaux directs entre les éléments de contrôle (K), afin d'élargir l'information des éléments de contrôle et des unités d'objet.
  7. Système selon la revendication 1, caractérisé en ce que des éléments de contrôle (K) sont reliés en série pour former un réseau, moyennant quoi l'information (I1) est acheminée depuis une unité de support (T1) vers une unité d'objet (04) par l'intermédiaire d'éléments de contrôle (K1 ... K4).
  8. Système selon la revendication 1, caractérisé en ce que des éléments de contrôle (K) sont reliés par l'intermédiaire d'une unité centrale (Z) pour former un réseau, moyennant quoi l'information (I1) est acheminée depuis une unité de support (T1) vers une unité d'objet (04) par l'intermédiaire de l'unité centrale (Z), dans laquelle est émulée la mise en réseau.
  9. Système selon l'une quelconque des revendications 1 à 8, caractérisé en ce qu'à partir des unités de support (T), des unités d'objet (O) et des éléments de contrôle (K) est formé un système avec une pluralité d'unités de support et d'unités d'objet du type suivant :
    objets : bâtiments caractérisés par une unité d'objet (O), installations fixes, installations mobiles ;
    fonctions des éléments de contrôle (K) : contrôle d'accès, gestion du temps, contrôle de présence ;
    supports : personnes caractérisées par une unité de support (T) ;
    avec l'objectif : accès d'une personne dans un bâtiment (par exemple, des locaux déterminés), manipulation par une personne sur une installation fixe (par exemple, commande par une personne autorisée à cet effet), temps de présence d'une personne dans une installation mobile (par exemple, contrôle de la durée du déplacement).
  10. Système selon l'une quelconque des revendications 1 à 9, caractérisé en ce qu'à des unités de support (T) relatives à des personnes et à des unités d'objet (O) relatives à des objets sont associés des moyens de mémoire aptes à émettre et à recevoir, en vue de recevoir et d'échanger des données d'identification et de fonction.
  11. Système selon l'une quelconque des revendications 1 à 9, caractérisé en ce qu'à des éléments de contrôle (K) sont associés des moyens aptes à émettre et à recevoir, en vue de recevoir et d'échanger des données d'identification et de fonction.
  12. Système selon la revendication 1, avec des unités de support (T) sous la forme d'une unité portable d'autorisation et d'identification ou de reconnaissance en interaction avec des unités d'objet (O) associées pour des objets d'accès et avec des éléments de contrôle (K) actifs et/ou passifs, caractérisé par une combinaison de forme modulaire entre une unité de support (T) relative à des personnes et un élément de mémoire apte à émettre et à recevoir par l'intermédiaire d'une antenne, laquelle unité de support travaille isolément ou conjointement avec une autre unité contenant une partie d'identification supplémentaire, mais différente, et avec une unité d'objet (O) relative à des objets pour l'interaction entre une personne et un objet, et avec des éléments de contrôle (K) pour le contrôle et le maintien des interactions par lesquelles des unités de support et des unités d'objet sont mises en réseau.
  13. Procédé d'identification de personnes et de contrôle et commande de l'accès de personnes à des objets, avec des unités de support (T) associées aux personnes et portées par les personnes, avec des unités d'objet (O) associées aux objets, et avec des éléments de contrôle (K), un élément de contrôle (K) étant associé à chaque unité d'objet (O) en vue de contrôler l'interaction entre les unités de support (T) et les unités d'objet (O), aucune liaison directe n'existant entre les unités de support (T) et aucune liaison directe n'existant entre les unités d'objet (O), caractérisé
    en ce qu'aux éléments de contrôle (K) du système est associé un jeu de données de bases commun contenant des données de base relatives aux unités de support (T) et aux unités d'objet (O),
    en ce qu'une liaison de communication bidirectionnelle est établie entre les éléments de contrôle (K),
    en ce que des liaisons unidirectionnelles sont établies depuis les unités de support (T) vers les unités d'objet (O), dans lesquelles aucune information ne peut circuler depuis les unités d'objet (O) vers les unités de support (T),
    et en ce que des liaisons bidirectionnelles sont établies entre des éléments de contrôle (K) et des unités de support (T) sélectionnées, ainsi qu'entre des éléments de contrôle (K) et des unités d'objet (O) sélectionnées.
  14. Procédé selon la revendication 13, caractérisé en ce qu'il est établi simultanément des réseaux virtuels par le jeu de données de base et des réseaux directs entre les éléments de contrôle (K), afin d'élargir l'information des éléments de contrôle et des unités d'objet.
  15. Procédé selon la revendication 13, caractérisé en ce que des cellules sont formées respectivement par une unité de support (T), une unité d'objet (O) et un élément de contrôle (K), la communication entre une unité de support (T1) et une unité d'objet (O 1) d'une cellule et une unité de support (T2) et une unité d'objet (O 2) d'une autre cellule ne pouvant être établie que par l'intermédiaire des éléments de contrôle (K1, K2) associés.
EP93810084A 1992-03-04 1993-02-11 Système d'identification de personnes Expired - Lifetime EP0559605B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CH682/92 1992-03-04
CH68292 1992-03-04

Publications (3)

Publication Number Publication Date
EP0559605A2 EP0559605A2 (fr) 1993-09-08
EP0559605A3 EP0559605A3 (en) 1995-06-21
EP0559605B1 true EP0559605B1 (fr) 2008-01-09

Family

ID=4192705

Family Applications (1)

Application Number Title Priority Date Filing Date
EP93810084A Expired - Lifetime EP0559605B1 (fr) 1992-03-04 1993-02-11 Système d'identification de personnes

Country Status (5)

Country Link
US (1) US5418525A (fr)
EP (1) EP0559605B1 (fr)
JP (1) JPH0689288A (fr)
AT (1) ATE383628T1 (fr)
DE (2) DE4230281C2 (fr)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5815114A (en) * 1996-04-05 1998-09-29 Discovision Associates Positioning system and method
DE29702795U1 (de) * 1997-02-18 1997-04-24 digi table thielen GmbH, 45141 Essen Vorrichtung zum Identifizieren von Informationsträgern
DE19708841A1 (de) * 1997-03-05 1998-09-17 Mediport Consult Gmbh Personenleit- und Informationssystem
FR2786637B1 (fr) * 1998-10-20 2001-05-04 Vincent Etancheite Dispositif et systeme de badgeage a moyens de localisation
DK1210693T3 (da) 1999-09-10 2004-02-16 Siemens Transit Telematic Systems Ag Fremgangsmåde og system til registrering af billetter
US7143049B2 (en) * 1999-09-10 2006-11-28 Siemens Vdo Automotive Ag Method and system for registering tickets
AT409238B (de) 1999-11-05 2002-06-25 Fronius Schweissmasch Prod Festlegen und/oder feststellen von benutzerberechtigungen mittels eines transponders,einer fingerabdruckerkennung oder dergleichen
US7376839B2 (en) * 2001-05-04 2008-05-20 Cubic Corporation Smart card access control system
JP5431671B2 (ja) * 2004-10-05 2014-03-05 コーニンクレッカ フィリップス エヌ ヴェ 相互作用型照明システム
US7701331B2 (en) * 2006-06-12 2010-04-20 Tran Bao Q Mesh network door lock
US8102240B2 (en) * 2007-12-27 2012-01-24 Honeywell International Inc. Controller providing shared device access for access control systems
CN119169733B (zh) * 2024-11-21 2025-02-11 易讯科技股份有限公司 一种结合人脸识别和行为分析的区域访问控制方法

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3757089A (en) * 1971-08-24 1973-09-04 North Electric Co Reporting and security system
DE3322524A1 (de) * 1983-06-23 1985-01-10 Berthold 7457 Bisingen Binder Verfahren und vorrichtung zur zugangskontrolle zu gebaeuden im alarmfall
KR870009095A (ko) * 1986-03-21 1987-10-23 존 디. 델폰티 키잉 시스템
IT1219481B (it) * 1988-03-04 1990-05-18 Emmepi La Sicurezza Proibita S Unita' periferica di controllo accessi e sistema integrato di telecontrollo
DE3920666A1 (de) * 1989-06-23 1991-01-10 Texas Instruments Deutschland Verfahren zum uebertragen von nachrichten mit vorgegebener nachrichtendauer von batterielosen transpondern zu abfragegeraeten
NO893527L (no) * 1989-09-01 1991-03-04 Trioving As Elekronisk styrt laassystem.
US5263158A (en) * 1990-02-15 1993-11-16 International Business Machines Corporation Method and system for variable authority level user access control in a distributed data processing system having multiple resource manager
ATE131296T1 (de) * 1990-03-19 1995-12-15 Bauer Kaba Ag Kontaktlose uebertragung von identifikationssignalen.
US5051741A (en) * 1990-03-28 1991-09-24 Wesby Philip B Locating system

Also Published As

Publication number Publication date
JPH0689288A (ja) 1994-03-29
EP0559605A2 (fr) 1993-09-08
US5418525A (en) 1995-05-23
ATE383628T1 (de) 2008-01-15
EP0559605A3 (en) 1995-06-21
DE4230281A1 (de) 1993-09-09
DE4230281C2 (de) 1997-04-30
DE59310393D1 (de) 2008-02-21

Similar Documents

Publication Publication Date Title
DE69131575T2 (de) Sicherheitssystem mit verteilter datei
EP0559605B1 (fr) Système d'identification de personnes
EP3307666B2 (fr) Systeme d'ascenseur dote d'une generation d'appel predictive
DE69316009T2 (de) Sicheres frontendverbindungssystem und verfahren fur prozesssteuerungsrechner
EP0788946B1 (fr) Procédé et dispositif pour la programmation de données opérationnelles dans des pièces de voitures
DE4026439A1 (de) Elektronisch gesteuertes schlosssystem
EP3729385A1 (fr) Système de contrôle d'accès avec authentification radio et acquisition de mot de passe
EP1321901B1 (fr) Méthode pour contrôler les droits d'accès à un objet
DE112020006933T5 (de) Authentifizierungsterminal und Sicherheitssystem
AT516288B1 (de) Verfahren und Vorrichtung zum Verwalten von Zutrittsberechtigungen
DE60002856T2 (de) Verfahren zur verwaltung von elektronischen fahrkarten und einrichtung zu dessen durchführung
WO1998034201A1 (fr) Procede d'exploitation d'un dispositif de telecommande et telecommande
DE602005006081T2 (de) Vorrichtung zum Schutz von Gleisarbeitern
WO2004034336A1 (fr) Systeme de controle d'acces et procede pour faire fonctionner un tel systeme
DE2747380A1 (de) Aktivatoreinheit fuer identifikationssysteme
DE102016210139A1 (de) Verfahren zum Setzen eines Identifikationsmerkmals, Fahrzeug, Betriebsverfahren für ein Sicherheitssystem und Sicherheitssystem
DE10144936A1 (de) Verfahren zur Prüfung der Zugangsberechtigung
EP1253559A2 (fr) Porte-carte et procédé pour combiner la carte d'identification d'entreprise et la fonction clé
EP2820796B1 (fr) Procédé de surveillance d'un système constitué d'une quantité de lecteurs et d'une pluralité d'unités de communication portatives.
DE69128126T2 (de) Personen- und/oder Objektlokalisierungssystem in einer überwachten Zone
EP4068229B1 (fr) Procédé de configuration d'un système de contrôle d'accès
DE9319568U1 (de) Zugangskontrollanlage
DE102018215739A1 (de) Verwendung einer Benutzerschnittstelle eines Fahrgastinformationssystems und/oder Unterhaltungssystems
WO1998029841A2 (fr) Systeme de reconnaissance pour la recherche et la reconnaissance de modeles de donnees, et systeme d'identification pour la memorisation et la reconnaissance de modeles de donnees
DE102010014934A1 (de) Verfahren und Vorrichtung zur Authentifikation oder Identifizierung einer Person oder eines Gerätes mit Hilfe von Sub-Identitäten des Trägers

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH DE DK ES FR GB IT LI LU NL PT SE

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE CH DE DK ES FR GB IT LI LU NL PT SE

17P Request for examination filed

Effective date: 19951130

17Q First examination report despatched

Effective date: 19971107

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH DE DK ES FR GB IT LI LU NL PT SE

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REF Corresponds to:

Ref document number: 59310393

Country of ref document: DE

Date of ref document: 20080221

Kind code of ref document: P

REG Reference to a national code

Ref country code: CH

Ref legal event code: NV

Representative=s name: FREI PATENTANWALTSBUERO AG

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080109

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080420

ET Fr: translation filed
BERE Be: lapsed

Owner name: BAUER KABA A.G.

Effective date: 20080228

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080609

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080409

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080109

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20081010

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20080228

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080109

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20080211

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20110302

Year of fee payment: 19

Ref country code: AT

Payment date: 20110214

Year of fee payment: 19

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20110217

Year of fee payment: 19

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: CH

Payment date: 20120116

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20120221

Year of fee payment: 20

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20120211

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20121031

REG Reference to a national code

Ref country code: AT

Ref legal event code: MM01

Ref document number: 383628

Country of ref document: AT

Kind code of ref document: T

Effective date: 20120211

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20120211

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20120229

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20120211

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 59310393

Country of ref document: DE

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20130212