| 摘要 |
The system is constructed as follows: in all locks and all keys, a system-specific code (basic code G) is stored; in addition, the lock memories (s1) also contain the respective lock numbers (nj) and the lock memories (S1, S2) contain the lock numbers (nj) for which the keys are to fit in each case. To save storage space in keys to which a multiplicity of locks is allocated, the numbers of fitting locks are combined as far as possible to form ranges of successive numbers and only the range limits are stored. The lock memories (S1, S2) suitably also contain a priority and key number (Pi, Ni) in each case, and the lock memories in each case contain corresponding priority numbers (pi); the lock microprocessors are programmed in such a manner that a key only fits when the following holds true: Pi = pi or pi + 1 (Pi is the priority number stored in the ith key, and pi is the priority number stored at the lock side for this key), and when in the case Pi = pi + 1 pi is incremented by one unit with the initial insertion. A lost key can thus be rendered invalid without converting the associated locks; the spare key only needs to receive a priority number which is higher by one unit. The main field of application: large ... Original abstract incomplete. <IMAGE>
|
