EP0197893A1 - Vorrichtung zum Lösen einer bedingten Sperre der Betätigung eines Schlosses - Google Patents

Vorrichtung zum Lösen einer bedingten Sperre der Betätigung eines Schlosses Download PDF

Info

Publication number
EP0197893A1
EP0197893A1 EP86810154A EP86810154A EP0197893A1 EP 0197893 A1 EP0197893 A1 EP 0197893A1 EP 86810154 A EP86810154 A EP 86810154A EP 86810154 A EP86810154 A EP 86810154A EP 0197893 A1 EP0197893 A1 EP 0197893A1
Authority
EP
European Patent Office
Prior art keywords
time
data
program
nxte
lifting
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.)
Granted
Application number
EP86810154A
Other languages
English (en)
French (fr)
Other versions
EP0197893B1 (de
Inventor
François Jolidon
Willy Richard
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.)
RELHOR
Original Assignee
RELHOR
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
Priority claimed from CH1375/85A external-priority patent/CH664794A5/fr
Priority claimed from FR8507476A external-priority patent/FR2582037A1/fr
Application filed by RELHOR filed Critical RELHOR
Priority to AT86810154T priority Critical patent/ATE49449T1/de
Publication of EP0197893A1 publication Critical patent/EP0197893A1/de
Application granted granted Critical
Publication of EP0197893B1 publication Critical patent/EP0197893B1/de
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
    • G07C9/00—Individual registration on entry or exit
    • G07C9/00174—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys
    • G07C9/00896—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys specially adapted for particular uses
    • G07C9/00912—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys specially adapted for particular uses for safes, strong-rooms, vaults or the like
    • 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/00174—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys
    • G07C9/00658—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys operated by passive electrical keys
    • G07C9/00674—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys operated by passive electrical keys with switch-buttons

Definitions

  • the present invention relates to the field of protection of security enclosures and it relates, more particularly, to a device for lifting a conditional ban on the operation of a lock, in particular of a safe, vault or other. protected enclosure.
  • the primary problem posed by such an installation is the determination of the time windows corresponding to the lifting of prohibitions, which is preferably done automatically and without the personnel who use the protected enclosure daily, being able to modify the data of the windows. at least in the sense of enlarging them.
  • This impossibility for the personnel to open the protected enclosure constitutes for them an additional security, since an attack outside the lifting windows of prohibition can thus be thwarted by the then inherent impossibility of the system of being able to be opened.
  • time windows can be modified according to circumstances such as the modification of the opening hours of the counters of a bank, the establishment of a night sale in a department store, or another establishment the closing period due to holidays, for example.
  • Such an adaptation must naturally be carried out by authorized persons who may or may not be those belonging to the personnel who usually use the protected enclosure.
  • the subject of the invention is therefore a device for lifting a conditional prohibition on the operation of a lock, in particular a safe, vault or other protected enclosure, comprising electro-mechanical blocking means which under the control of an electronic circuit are capable of imposing the prohibition or the lifting of the prohibition of operation of said lock, characterized in that said electronic control circuit comprises a memory in which is stored a time program intended to be executed cyclically and defining at least one time window for lifting a ban and means associated with this memory for periodically comparing the official time with the times surrounding said time window and means for controlling said blocking means to block or release said lock when there is tied between official time and said times.
  • the prohibition lifts for the operation of the lock are determined according to the official time so that the windows which frame the prohibition lifts can be fixed simply by entering a time in the device. opening and closing time.
  • Figs. 1 and 2 respectively represent the front face of a safe and the internal face of the door of the latter.
  • the lock assembly of this safe is conventional, it is not useful to give here a detailed description or a complete representation. It suffices to note that this lock assembly 1 comprises a linkage 2 provided with bolts 3 and which can be moved from a locking position to an unlocking position and vice versa using a steering wheel 4.
  • a lock including the trunk is shown in 5 and whose bolt is shown in 6 can be actuated using a conventional key through a keyhole 7, this lock can of course be as complex as may be desired in the context of the security to be assured with regard to the contents of the safe.
  • the bolt 6 cooperates with a bar 8 of the linkage 2, this bar being here slidably mounted in the horizontal direction and comprising a rack 9 with which a pinion 10 mounted on the flywheel 4 cooperates.
  • the device according to the invention makes it possible to oppose the operation of this linkage 2 a second locking element 11 whose control determines the lifting of prohibition on condition of the opening of the lock of the safe. Indeed, although this is only shown very briefly in FIG. 2, it can be seen that the locking element 11 can move vertically and thus prevent sliding in the direction of opening of the linkage 2 by entering a cutout 12 which is at the rear of the bar 8.
  • the second locking element 11 is motorized and controlled by an electronic circuit 13 to which are connected on the one hand a control keyboard 14 and on the other hand a display device 15, the keyboard being inside the door, while the display device comprises two display fields appearing respectively on either side of the latter.
  • the locking element 11 is produced in the form of a slide mounted axially movable in a guide 16 of a frame 17 formed on the door of the safe.
  • the latter also has a corridor 18 in which the bar 8 of the linkage 2 slides and on which the guide 16 opens so that the slide 11 can oppose the recoil movement of the bar 8 when leaving the guide 16, it is placed across corridor 18.
  • This movement is controlled by an engine assembly 19 comprising an actual engine 20, a lever 21 articulated on the frame 17 and a cam 22 mounted on the output shaft of the engine 20 and provided with an eccentric guide groove 23 in the shape of an arc of a circle, groove in which slides a pin 24 integral with the lever 21.
  • the lever 21 is attached by its free end to the lower end of the slide 11 and like the pin 24 is located at half of the lever 21, it is understood that if the motor 20 is actuated, the lever can raise the slide 11 while the pin moves in the guide groove 23 and that the reverse movement causes the descent of this slide.
  • Fig. 4 shows a simplified diagram of the electronic circuit which is used with the mechanical device which has just been described.
  • the bar 8 the slide 11 driven by the motor 22, the keyboard 14 and the display device 15.
  • the latter, as well as the keyboard 14, constitute 'peripherals of a microprocessor 30 which is also connected to a time-based circuit 31, to a memory 32 of the RAM / ROM type and to an amplifier circuit 33 responsible for supplying energy to the motor 22 when a command comes to it for this purpose from the microprocessor 30.
  • the keyboard 14 comprises the usual numeric keys 34, shift keys 35 to allow successively acting on the data appearing in the boxes of the display field, to the left and to the right, a modification key 36, a key 37, a "delete” key 38 and a “delete” key 39.
  • the keyboard 14 is intended to allow the introduction of programming data into the electrical circuit according to procedures which can be carried out either by the user daily from the safe, either by an authorized person, whereby the latter must have a secret code, in principle unknown to the daily user. Since such procedures for access by a user code are known in the art of microcomputers, it is not necessary to describe them in detail here.
  • the display device 15 comprises eight display fields, the four fields grouped on the right are intended for indicating the time and the four fields on the left respectively indicate from right to left: the day of the week (1 to 7), the relative week (0 to 3), this concept being explained later, the opening or closing of the safe (the opening condition being represented here), and finally the indication of the instantaneous operating mode of the electronic circuit. It should be noted that this display device 15 is of the interactive type and therefore allows a dialogue between the operator of the keyboard 14 and the display device 15, in particular during a modification of the programming of the following device. the invention.
  • Fig. 5 shows a diagram as a function of time illustrating an example of operation that can be executed by the device according to the invention.
  • the curve a in this diagram represents a basic weekly program which is cyclical and which therefore returns in principle every week.
  • each day presents two opening windows, respectively between 10 and 12 hours and between 1400 and 1800 hours.
  • This program is pre-established by an authorized person having the secret access code, the daily user being unable to edit. It should be noted that in the example which will be described in the continued, up to four of these opening windows can be programmed each day. Thus, this program determines beforehand the lifting periods prohibiting the opening of the lock.
  • this lifting of the ban may be subject to certain other conditions which may be imposed either by the authorized person or by the daily user, which is illustrated by curves b and c in fig. 5.
  • the basic weekly program for curve a can be inhibited for a period ranging from several hours to a few weeks.
  • this inhibition is not cyclical, but must be programmed by the authorized person step by step and be automatically deleted after its execution.
  • the so-called imposed inhibition (since the daily user cannot erase it) can be useful for example to prohibit opening during a holiday period, a holiday bridge associated with a public holiday, etc.
  • inhibition can be given in "relative" weeks (which are from 0 to 3 in number), in days (from 1 to 7), in hours and minutes between the start time and the end time inhibition.
  • “relative” weeks which are from 0 to 3 in number
  • days from 1 to 7
  • hours and minutes between the start time and the end time inhibition.
  • the imposed inhibition period begins on Tuesday at 8.30 am and ends on Friday at 6 am.
  • Curve c represents the "chosen” inhibition, that is to say selectable by the daily user who does not have the secret access code. This inhibition can be useful when the user must be absent during the day for one or more periods, which is the case in the example shown for the day on Monday. Indeed, the opening ban is established between 10.00 a.m. and 11.30 a.m. and from 4.30 p.m. to 6 p.m.
  • Curve d thus represents the effective opening periods or periods of lifting of prohibition which are hatched for greater clarity.
  • fig. 5 represents only a single example of determining the programming of the lifting of the ban, any other combination of the opening and closing periods which can be chosen as required, either by the authorized programmer or by the user. daily. Furthermore, at any time, if one is inside the enclosure, immediate opening and closing can be requested by both types of operators.
  • Fig. 6 schematically represents the organization of the RAM part of the memory 32 in which the data which are essential for the implementation of the invention are stored.
  • the weekly program is recorded in a maximum of 112 bytes in the example shown, this program being used cyclically week after week.
  • Each day can be assigned four ban lifting windows, numbered F, to F., each window requiring for its definition two bytes for opening and two bytes for closing.
  • Another memory field is intended to contain variable parameters, some of which occupy three bytes and others of which occupy only two.
  • Fig. 7 shows two examples of groups of bytes used for this memory organization.
  • the upper part of fig. 7 represents the content of two bytes, hereinafter called “short” data, used for the definition of opening or closing a window F, at F 4 , while the lower part represents a group of three bytes corresponding to "long" data.
  • the first byte of a short datum contains the units of the minutes (0 to 9) on four bits, the four most significant bits being assigned to the tens of minutes (0 to 5).
  • the second byte comprising in its four least significant bits, the units of hours (0 to 9), the next two bits being assigned to the tens of hours (0 to 2), the remaining bits corresponding respectively to variables P and S can each admit two states 0 and 1.
  • the bit P, when it is at 1, means that the short datum in question is programmed and, when it is at zero, that this datum is not programmed.
  • the bit S, when it is at 1 means that after processing this data, the slider 11 (fig. 2 and 3) must be lowered to unblock the passage of the bar 8, while when this bit is at zero , the reverse movement must be triggered.
  • Long data has in its first two bytes the same information as that used to define a short data, while the third byte of long data defines in its four least significant bits the days of the week (0 to 6) and in the other four bits "relative weeks" (0 to 3).
  • relative week means the days extending from today to today + 6 days for the first week numbered 0, the days of relative week no 1 extending from today + 7 days to today + 13 days, etc.
  • the relative week can start on any day of the calendar week, that is to say in relation to the weekly program defined in memory 32 .
  • Figs. 8a to 8c represent the flowchart of the main program implemented in the microprocessor 30.
  • This main program comprises a certain number of subroutines as well as a calculation loop which takes place in the last phase of the execution of this main program.
  • This calculation loop itself comprises a certain number of subroutines which will all be described in detail below.
  • the main program consists essentially of four parts, the first of which calculates the time (fig. 8a), the second of which essentially aims to compare the current time with the NXTE data defining the previously calculated event, the third part ensuring the actual control of the movement of the slider 11 as a function of the constraints imposed by the program, and the fourth part being the calculation loop of which we have just spoken.
  • the main program is executed every half-second under the control of a signal which is applied to the microprocessor 30 by the time base 31.
  • the latter can be formed by a conventional division chain controlled by a quartz oscillator.
  • a test is first carried out at 51 to find out whether the content of a register of seconds SECS is equal to. 119. It will be noted in passing that the program makes use of a certain number of registers which, conventionally, form part of the microprocessor 30.
  • test is negative, the content of the register is - incremented by one at 52 and the program ends at 53 until the next half-second is triggered. If, on the other hand, the test is positive, the number zero is placed in the SECS register (operation 54). .
  • the number examined during test 51 is a function of the frequency with which one wishes to execute the main program and it can be different from once every two minutes.
  • a test is carried out at 55 to determine whether the first byte of the HRAC data contained in the memory 32 (units and tens of minutes) is equal to 59. If the test proves negative , the content of the byte in question is incremented by one at 56 and the program switches to a "long comparison" subroutine 57 (fig. 8b), a detailed description of which will be given below.
  • test 55 proves positive, the number 0 is placed in the aforementioned byte at 58 and the program passes to a test 59 to determine whether the content of the second byte of the HRAC data contains a number of hours equal to 23 If the test is negative, the content of this byte is incremented by one at 60 and the program also goes to subroutine 57. If the test is positive, the number zero is placed in the byte in question in 61. This obviously means that we go from one day to the next day, because the time then corresponds to midnight.
  • the program then goes through three subroutines 62, 63 and 64 called "relative week update program", a detailed description of which will be given below (fig. 8b).
  • the program goes to a test 65 to determine whether the content of the days part of byte 3 of the HRAC data is equal to 6. If the test proves negative, the content of this part of byte 3 is incremented by one at 66 and the program goes to subroutine 57. On the other hand, if the test proves positive, zero is placed in the part concerned by byte 3 (operation 67) and the program also goes to subroutine 57.
  • the sub-program 57 corresponds to the long comparison CDL, according to the procedure of FIG. 11, of the variable HRAC and of the variable NXTE which is, expressed in hourly data, the time at which the next event will take place, this variable having been calculated before. She depends therefore of the time program of curve a of FIG. 5 and of the constraints introduced by the inhibitions imposed and chosen, according to curves b and c of this same figure.
  • the main program ends and the device waits for the next initialization of the program by returning to the initialization operation 50 when half a second has passed.
  • the main program will execute its third part to place the slider 11 in the position required by the data obtained after the execution of the sub-program 57.
  • a test is carried out at 68. to determine the value at which the bit S of the variable NXTE is established. If this bit is at zero, the circuit generates a "logically closed" signal at 69, which does not yet mean that the motor 20 driving the slider 11 will be actuated in the closing direction. Indeed, it is first necessary to examine in which position the slide is located. After passing a test in 70, the usefulness of which will be explained later, and assuming that the answer to this test is negative, a test is carried out to determine in what position the slide 11 is actually in relation to the positions of the switches 26 and 27. If it is then found that the slider is open, the motor is triggered according to operation 72 and the slider is raised by the motor 20 controlled by the microprocessor through the amplifier 33. The program passes then on the “calculation of the next event” loop 73. If the tests 70 and 71 prove to be positive, the program also passes on this same loop 73, by the common operation 74.
  • test 68 proves to be affirmative, the same operations take place, but this time with respect to the state of opening of the slide 11, the program passing through the operations 75 to 78 which all end equally on loop 73.
  • the device places the slide in the position required by the constraints illustrated in FIG. 5 as a function of the variable NXTE previously calculated, after which, during the fourth part, the device will examine what is the nature of the next event and calculate exactly the next variable NXTE which is then stored in memory 32 to be used during of the execution of the next routine 57 leading to the comparison with the current time.
  • a CDL subroutine 81 is performed between the NXTE datum and the content of the two bytes corresponding to the INH1 datum. If, following this comparison, it turns out that INH1 is not programmed, is greater than the variable NXTE (corresponding to this instant at the moment) or is equal to this data, the program switches to a following subroutine 82 called "localization in the weekly program" - (LPH; see fig. 12b).
  • the comparison of the subroutine 81 leads to note that INH1. East. lower than NXTE, which means that the current time is either in an imposed inhibition period or before this period, it is to be determined by the CDL 82 subroutine which is a long comparison between INHO and NXTE if the current time is within or before the imposed muting period. If the subroutine 83 determines that it is still before the inhibition period, the program goes to the subroutine 82. On the other hand, if it turns out that there is equality between the two data, the program goes to operation 84 (fig.
  • subroutine 82 determines whether the data contained at this instant in the NXTE bytes, according to operation 80 (fig. 12a) falls into an opening window of the corresponding day of the basic weekly program (fig. 5), and to determine if there is an event of the corresponding day which follows this data.
  • the subroutine 82 is initialized at 85 and the first operation 86 consists in placing in a register of the microprocessor JR the bits of the third byte of the data NXTE (which therefore correspond to today), then during 'a operation 87 of placing the number zero in another register NE of the microprocessor.
  • the contents of the registers JR and NE are then used as pointer to the bytes of memory 32 in which the weekly program is stored - (curve a in fig. 5).
  • the content of the bytes designated by the pointer (in this case, for example, the two opening bytes of window F, which are then extracted from the memory) is subjected to a comparison subroutine at 88 according to the process. table illustrated in fig. 9.
  • the parity of the number NE is representative of the opening or closing state of a window, an odd number corresponding obligatorily at the opening and a number even at a closing, it being understood that in the example represented, at most four successive openings and closings can occur, the number NE of the events therefore being at most equal to eight.
  • NXTE and PROG JR, NE
  • the content of the NE register is incremented by one at 89 and a test is performed at 90 to determine if NE is equal to the maximum number of possible events scheduled in the weekly schedule, this number being therefore eight in the example described. If this test proves negative, the program loops back to subroutine 88 to extract from memory the second event of the day pointed to by the registers JR and NE. A new comparison is then performed on NXTE, i.e. the current time and PROG (JR, NE).
  • the program performs a new test at 91 to determine whether NE is even or odd. If NE is even, we are faced with a second case, namely that the slide is in its closed position and that there is an event. of the program that will succeed at the moment that day. If, on the other hand, the test carried out in 91 turns out to be positive, we are faced with a third case corresponding to the opening position of the slide 11 and the programming, that day, of the end of the window in presence.
  • the program continues as previously described with regard to the finding of equality of the two corresponding data. If, finally, the subroutine 88 establishes that PROG (JR, NE) is not programmed, the program passes to a test 92 to examine the parity of the number NE. If this number is even, we are in the presence of case no 1 and otherwise we are in the presence of a case no 4 corresponding to the opening position of the slide 11, that is to say the The current time is in an opening window and this window lasts until midnight of the current day.
  • the subroutine 82 gives rise to four possible cases which will be examined successively now.
  • the program switches to an RDPF 93 (Search for Beginning of Next Window) subroutine, the operations of which have been detailed in FIG. 14 to which we will now refer.
  • the subroutine 93 is initialized at 94 and the first operation consists in placing the value zero in the register NE (operation 95). Then, a test is carried out to determine if NE is equal to the maximum number of events of the day (operation 96). If the test 96 establishes the inequality, the program passes to a test 97 to determine the program bit P of the PROG data item (JR, NE).
  • test at 98 proves positive, the NE register is incremented by one unit at 100 and the program loops back to test 96 and the operations previously described are repeated.
  • This subroutine is called when we are looking for the next event in the basic weekly program and when, having already reached the last scheduled event of the day we are working on, we must go to the day following.
  • this subroutine we use an auxiliary variable NC which aims to avoid that in the absence of a program we change more than seven times a day.
  • the subroutine 101 after initialization at 102, performs a test 103 to determine if the content of the register NC is equal to 7. If this is the case, it is an error which is signaled on the device d 'display and which results in putting the slide 11 in the open position, which is also the case each time an error is observed during the course of the program.
  • test 103 If the test 103 is negative, the register NC is incremented by one unit (operation 104) and the number zero is placed in the register NE. Then, a test is performed in 105 to determine whether the content of the JR register is equal to 6. If this test proves positive, the number zero is placed in the JR register and if not, this register is incremented by one unit (operations 106 and 107). Then, operation 108 consists in transferring the content of the register JR into the corresponding bits of the data NXTE of the memory 32. Then, a test is carried out in 109 to check the equality between the content of the register JR and the day of HRAC data. If this test proves negative, the program loops back to test 97 of the subroutine 93 (fig. 14) and if not, the number of the NXTE data item corresponding to the week is incremented by one unit (operation 110 ) after which we also go back to test 97.
  • the program switches to a subroutine 111 (fig. 12b) which consists in making a long comparison between the content of the bytes of the NXTE data which then does not correspond at present, but at a calculated value and the INHO data. If this comparison determines that INHO is not programmed or if NXTE precedes INH0, the program goes to operation 112 which consists in placing the value 1 in the bits P and S of the data NXTE, which completes the calculation of this given. If, on the other hand, the comparison establishes equality between NXTE and INH0, or if NXTE succeeds INHO, a new long comparison is carried out in 113 between INH0 and INH1. If INH1 succeeds INHO, the program goes to operation 84 (fig. 12e). In the other three cases, this is an error (operation 114) and a zero is placed in the PNXTE bit.
  • case no. 3 corresponds to the open position of the slide and the programming of the end of the window in progress
  • case 4 also corresponds to the slide opening position, the window being established until midnight.
  • the program switches to a new subroutine 118 for short comparison between the data item PROG (JR, NE) (see subroutine 82) and the data item AJT1. If AJT1 is not programmed, if it is equal to PROG - (JR, NE) or if AJT1 succeeds PROG (JR, NE) the program also loops back to subroutine 93. On the other hand, if PROG (JR, NE) succeeds AJT1, the values of minutes and hours of this data are transferred in the corresponding bits of the NXTE bytes of memory 32 (operation 119). After this operation, the program loops back to the long comparison subroutine 111 to complete the other bits of the data NXTE during operation 112, or to detect errors (operation 114).
  • test carried out in 116 being negative, a short comparison is also carried out on the data NXTE and AJT1 (subroutine 120), but in this case it is only when NXTE - (current time) precedes AJT1 that we pass to operation 119, the three other cases leading to loopback on the subroutine 93. If the tests 115 and 116 prove to be positive, the same comparison operations are carried out on the data AJT0 in accordance with the subroutines 121, 122 and 123 (fig. 12d).
  • subroutines 121 and 122 When subroutines 121 and 122 establish either that AJT0 is not programmed, or that NXTE is greater than AJT0, or that the two data are equal, the program switches to an RFFA search end of window subroutine Current (Fig. 16). The program also switches to this subroutine 124 at the end of the execution of the subroutine 123 when it turns out that AJT0 is not programmed or when AJT0 is greater than PROG (JR, NE).
  • the purpose of the subroutine RFFA 126 is to find the end of the current window, to allow the end of this window to place in the "S" bit of the NXTE signal, the value 0 having the purpose of causing the mo, uvement of the slide 11 in the closing direction.
  • the subroutine 124 (FIG. 16) runs almost entirely like the subroutine 93 in accordance with the operations 94 to 101 already described with reference to FIG. 14. The difference consists in that, at the end of the running of the subroutine 101 (fig. 15), that is to say when the test 109 turns out to be negative or that the updating of the bits of the NXTE signal corresponding to the number of weeks, is carried out according to operation 110, the subroutine 124 performs a test 127 to determine whether the bit P of the PROG datum, (JR NE) is equal to 1, being recalled that this datum was retrieved from memory based on the contents of the JR and NE registers.
  • JR NE bit P of the PROG datum
  • tests 128 and 129 are carried out on the hour and minute values of the PROG data item (JR, NE) to check whether these values are equal to zero. If tests 128 and 129 prove to be negative, zero values are introduced into the corresponding bits of the bytes of the NXTE data item, in accordance with operation 130, after which the program reconnects to the program 73 for calculating the next event (fig. . 12d). If tests 128 and 129 are both positive, this means that, in one particular case, an opening window has been programmed which overlaps midnight. It is then necessary to search for the next event of the new day, so that the value NE is incremented according to operation 100.
  • the operations 127 to 130 therefore aim to avoid that, when the opening is programmed to overlap midnight, the slider is not successively brought into the closed position and into the open position, but remains on the contrary in the open position, despite the fact that in reality, at midnight, by convention, the slider 11 must always be in its closed position.
  • the program - switches to a long comparison subroutine 131 to check if the current value of the given NXTE does not correspond to an INH0 datum, that is to say with an imposed start of inhibition.
  • INH ⁇ data is not programmed or if it succeeds to NXTE or if it; is equal to INH0, values of 1 and 0 are respectively placed in the bits P and S of the data NXTE - (operation 132), after which the calculation of NXTE is completed.
  • this data is placed in the bytes of NXTE (operation 133), after which the same bit values are placed in the bits P and S of NXTE according to the operation 132.
  • the same operation is carried out if, after a test 134 made after finding an error in the subroutine 101 taking place in the context of the execution of the program 124 (fig. 16), it is checked whether the bit P of the data INH0 is equal to 1. If this is not the case, 0 is placed in this bit and there is an error.
  • the operation 84 already mentioned consists in placing the value 'INH1 in the bytes NXTE, after which the subroutine 82 is executed to locate this data in the weekly program.
  • the subroutine 82 ends in case no 1 or in case no 2, we will execute the subroutine 93 to find the start of the consecutive window. If cases no 3 or no 4 occur, values 1 are respectively placed in bits P and S of the data NXTE and the calculation of the next event ends. If the subroutine 93 results in the observation of an error, the value zero is placed in the bit P of the data item NXTE and an error is noted (operations 136 and 137).
  • the subroutine ends. If programmed, it is checked during test 140 whether the day value of the HRAC data corresponds to the day value of the data examined. If it does not match, the routine ends. If it corresponds, it is checked during test 141 if the week value of the data examined is equal to zero. If this is the case, the value zero is placed in the bit P of the data examined. On the other hand, if this is not the case, the week value of the data examined is decremented by one unit (operations 142 and 143, respectively) after which, the subroutine in question ends and the operations reconnect to the main program.
  • the request signal can be presented at any time, a signal which can possibly be associated with a special code known only to authorized persons. If the opening is so requested, the algorithm of figs. 18a and 18b impose a period limited to the possibility of opening, although this opening does not occur until after the waiting period mentioned above.
  • the timing algorithm of Figs. 18a and 18b consists, after an initialization at 144, of first examining a transition of the request signal using tests 145, 146 and 147. These tests consist in examining the state of a flag FR which is established to zero after test 146 (operation 148) or to one (149).
  • a test is performed at 150 to determine if there is an error. If this test is negative, we will examine in 151 if there is a logical opening. In the positive case, a test is carried out to examine whether the variable TEMP is equal to zero, this variable being the set value corresponding to the delay time which is here three minutes. If the TEMP variable is equal to zero, the motor 20 is controlled in the opening direction (operation 153), after which the TEMP variable receives the value 3. If tests 151 and 152 prove to be negative, the motor 20 is controlled in the closing direction (operation 154) which also loops back to operation 155 for adjusting the TEMP variable. Then the program continues by updating a TEMPO variable to its initial value of 120 half-seconds executed during operation 156 appearing in FIG. 18b.

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Electric Clocks (AREA)
EP19860810154 1985-03-29 1986-03-27 Vorrichtung zum Lösen einer bedingten Sperre der Betätigung eines Schlosses Expired - Lifetime EP0197893B1 (de)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AT86810154T ATE49449T1 (de) 1985-03-29 1986-03-27 Vorrichtung zum loesen einer bedingten sperre der betaetigung eines schlosses.

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CH1375/85 1985-03-29
CH1375/85A CH664794A5 (fr) 1985-03-29 1985-03-29 Dispositif de levee d'interdiction conditionnelle de la manoeuvre d'une serrure.
FR8507476 1985-05-14
FR8507476A FR2582037A1 (fr) 1985-05-14 1985-05-14 Dispositif de levee d'interdiction conditionnelle de la manoeuvre d'une serrure

Publications (2)

Publication Number Publication Date
EP0197893A1 true EP0197893A1 (de) 1986-10-15
EP0197893B1 EP0197893B1 (de) 1990-01-10

Family

ID=25687480

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19860810154 Expired - Lifetime EP0197893B1 (de) 1985-03-29 1986-03-27 Vorrichtung zum Lösen einer bedingten Sperre der Betätigung eines Schlosses

Country Status (2)

Country Link
EP (1) EP0197893B1 (de)
DE (1) DE3668213D1 (de)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2205126A (en) * 1987-05-15 1988-11-30 Fox Thomas Co Ltd An electronic time lock
EP0327145A2 (de) * 1988-02-03 1989-08-09 Omen Metal Products Safe mit zugehörige Bedienungsanordnung
GB2221947A (en) * 1988-08-19 1990-02-21 Sargent & Greenleaf Electronic time lock
US4944170A (en) * 1986-08-20 1990-07-31 Relhor S.A. Device for lifting a time ban on the actuation of a mechanism in a conditional-opening locking system in the event of a breakdown
EP0537009A1 (de) * 1991-10-11 1993-04-14 Ilco Unican, Inc. Türverriegelungssystem
WO1994022736A1 (en) * 1993-03-26 1994-10-13 Craig Hart Macdougall Time capsule
EP0676519A1 (de) * 1992-09-17 1995-10-11 Total Security Installations Limited Sicherheitssystem mit Schloss

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3881171A (en) * 1973-12-03 1975-04-29 Mosler Safe Co Vault protected with electronic time and combination lock
US4293915A (en) * 1979-04-16 1981-10-06 Pacific Technology, Inc. Programmable electronic real-time load controller
EP0102346A2 (de) * 1982-07-29 1984-03-07 Wertheim-Werke Aktiengesellschaft Geldschrank mit einer Fehlbedienungssicherung
US4472789A (en) * 1979-11-09 1984-09-18 General Signal Corporation Vital timer

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3881171A (en) * 1973-12-03 1975-04-29 Mosler Safe Co Vault protected with electronic time and combination lock
US4293915A (en) * 1979-04-16 1981-10-06 Pacific Technology, Inc. Programmable electronic real-time load controller
US4472789A (en) * 1979-11-09 1984-09-18 General Signal Corporation Vital timer
EP0102346A2 (de) * 1982-07-29 1984-03-07 Wertheim-Werke Aktiengesellschaft Geldschrank mit einer Fehlbedienungssicherung

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ELEKTOR, vol. 9, no. 4, avril 1983, pages 442-450, Canterbury, Kent, GB; "7-day timer/controller", *

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4944170A (en) * 1986-08-20 1990-07-31 Relhor S.A. Device for lifting a time ban on the actuation of a mechanism in a conditional-opening locking system in the event of a breakdown
GB2205126A (en) * 1987-05-15 1988-11-30 Fox Thomas Co Ltd An electronic time lock
GB2205126B (en) * 1987-05-15 1992-01-08 Fox Thomas Co Ltd An electronic time lock
EP0327145A2 (de) * 1988-02-03 1989-08-09 Omen Metal Products Safe mit zugehörige Bedienungsanordnung
EP0327145A3 (de) * 1988-02-03 1990-05-30 Omen Metal Products Safe mit zugehörige Bedienungsanordnung
GB2221947A (en) * 1988-08-19 1990-02-21 Sargent & Greenleaf Electronic time lock
GB2221947B (en) * 1988-08-19 1992-08-05 Sargent & Greenleaf Electronic time lock
EP0537009A1 (de) * 1991-10-11 1993-04-14 Ilco Unican, Inc. Türverriegelungssystem
US5339662A (en) * 1991-10-11 1994-08-23 Ilco Unican, Inc. Door locking system
EP0676519A1 (de) * 1992-09-17 1995-10-11 Total Security Installations Limited Sicherheitssystem mit Schloss
WO1994022736A1 (en) * 1993-03-26 1994-10-13 Craig Hart Macdougall Time capsule

Also Published As

Publication number Publication date
DE3668213D1 (de) 1990-02-15
EP0197893B1 (de) 1990-01-10

Similar Documents

Publication Publication Date Title
CH664794A5 (fr) Dispositif de levee d'interdiction conditionnelle de la manoeuvre d'une serrure.
EP0805906B1 (de) Programmierbare elektronische verschlusseinrichtung
EP0275789B2 (de) Diebstahlsicherung mit einstellbarem Kode für Kraftfahrzeuge
FR2790576A1 (fr) Procede d'identification pour acceder a des zones protegees et cabine de mise en oeuvre
FR2567947A1 (fr) Systeme de controle d'acces a lecture de texture de surface
FR2586447A1 (fr) Dispositif de securite a acces multiples
EP0197893B1 (de) Vorrichtung zum Lösen einer bedingten Sperre der Betätigung eines Schlosses
FR2661021A1 (fr) Systeme de rangement a casiers adjacents utilise notamment dans des gares ou des aeroports.
EP0020247A1 (de) Einrichtung zum autorisierten Öffnen einer Tür mittels einer kodierten Karte
EP0147276B1 (de) Kodierbare Steuerungsanordnungen
FR2582037A1 (fr) Dispositif de levee d'interdiction conditionnelle de la manoeuvre d'une serrure
EP0158577B1 (de) Kontrolleingangsschleuse für Panzerräume
CH690502A5 (fr) Système à déclenchement programmable pour le verrouillage/ déverrouillage temporisé d'une installation de sécurité.
FR2526474A1 (en) Intelligent monitoring system for bank safe deposit room - uses microcomputer to cyclically interrogate individual box lock detectors and to test for abnormal numbers or frequency of openings
EP0985790B1 (de) Dynamisch gesteuertes elektronisches Schloss und mit einem solchen Schloss versehenes Steuerungssystem
FR2657446A1 (fr) Procede et dispositif destine a controler et a permettre l'acces a un site ou a un service.
FR2717932A1 (fr) Dispositif pour la délivrance sélective et la récupération contrôlée d'objets.
FR2467946A1 (fr) Serrure electronique a alarme
FR2666614A1 (fr) Dispositif de commande d'ouverture de portes, notamment de coffres-forts et, en general, de toutes portes fortes.
EP0724056B1 (de) Fernbedienungseinrichtung mit Hertzschen, infraroten Wellen od. dgl. zur Steuerung von motorbetriebenen Schliesssystemen
EP0549546B1 (de) Tresor zur Aufbewahrung und Aufnahme von Wertgegenständen
EP0585513B1 (de) Verfahrenssteuerungssystem mit Simultaneitätstabelle
BE1011094A7 (fr) Procede et systeme de controle programmable pour processus controle.
FR2729424A1 (fr) Serrure electronique a carte magnetique
FR2705117A1 (fr) Serrure électronique programmable.

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: A1

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

17P Request for examination filed

Effective date: 19861103

17Q First examination report despatched

Effective date: 19880901

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 FR GB IT LI LU NL SE

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

Ref country code: SE

Effective date: 19900110

Ref country code: NL

Effective date: 19900110

Ref country code: AT

Effective date: 19900110

REF Corresponds to:

Ref document number: 49449

Country of ref document: AT

Date of ref document: 19900115

Kind code of ref document: T

REF Corresponds to:

Ref document number: 3668213

Country of ref document: DE

Date of ref document: 19900215

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

Ref country code: GB

Payment date: 19900228

Year of fee payment: 5

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

Ref country code: FR

Payment date: 19900314

Year of fee payment: 5

ITF It: translation for a ep patent filed

Owner name: ING. C. GREGORJ S.P.A.

ITTA It: last paid annual fee
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: 19900331

Ref country code: BE

Effective date: 19900331

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)
NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
BERE Be: lapsed

Owner name: S.A. RELHOR

Effective date: 19900331

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
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Effective date: 19910327

GBPC Gb: european patent ceased through non-payment of renewal fee
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Effective date: 19911129

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

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

Ref country code: CH

Payment date: 20020304

Year of fee payment: 17

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

Ref country code: DE

Payment date: 20020313

Year of fee payment: 17

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

Ref country code: LI

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

Effective date: 20030331

Ref country code: CH

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

Effective date: 20030331

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 NON-PAYMENT OF DUE FEES

Effective date: 20031001

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: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 20050327