Design and Analysis of a Failsafe Algorithm for Solving Boolean Equations
Since the installation of the first mechanical interlocking in 1856, railway signal engineers have developed a set of rules which define the essential requirements for safe train movement. In the majority of cases this set of rules can be expressed as a closed set of boolean equations which, when implemented as written, yield a safe operating system. The boolean equation set will vary depending upon the particular requirements of each application. The set of general rules are imposed on the specific requirements of each application to yield a closed set of boolean equations which completely describe the safety and operational requirements of that application.
Unable to display preview. Download preview PDF.
- Butler, R. W. and Finelli, G. B. The Infeasibility of Quantifying the Reliability of Life-Critical Real-Time Software. IEEE Trans. on Software Engineering 1993; 19:3–12.Google Scholar
- Hoelscher, J. R. and Balliet, J. B. Microprocessor-Based Interlocking Control — Concept to Application. 1986 APTA Rapid Transit Conference, June 4, 1986.Google Scholar
- Rutherford, D. B., Jr. Failsafe Microprocessor Interlocking — An Application of Numerically Integrated Safety Assurance Logic. Proc. Institute of Railway Signal Engineers. London. Sept. 1984.Google Scholar
- Rutherford, D. B., Jr. A Vital Digital Control System with a Calculable Probability of an Unsafe Failure. IEEE CH2830-8/90/0000-0001. August, 1990.Google Scholar
- Peterson, W. W. and Weldon, E. J., Jr. Error-Correcting Codes. The MIT Press, Cambridge, 1972.Google Scholar