【24h】

HAZARDS, DANGER CONDITION AND BASIC SAFETY POSTULATE IN ANALYSIS OF SAFETY-CRITICAL ALGORITHMS

机译:安全关键算法分析中危害,危险条件与基本安全假设

获取原文

摘要

The paper demonstrates a new way to development of clear and rigorous safety specifications for algorithms of safety-critical software. The proposed approach based upon the concepts and notions of Formal Qualitative Safety Analysis (FQSA). A given algorithm is described by Gurevich's Abstract State Machine. The analysis based upon the assumption that some Catastrophe Condition is specified. The analysis results in formal expressions for corresponding Catastrophe Inevitability Condition, Danger Condition, Safety Condition and Basic Safety Postulate for a given algorithm. Basic Safety Postulate establishes safety requirements for environment of a given algorithm and also characterizes the own internal safety of the algorithm by a qualitative logical way. Safety Condition allows making a safe version of the initial algorithm. All concepts and notions are introduced and illustrated during the analysis of simple inertial algorithm.
机译:本文展示了开发清晰严格的安全规范的一种新的安全关键软件算法的新方法。基于正式定性安全分析(FQSA)的概念和概念的提出方法。 Gurevich的抽象状态机描述了给定的算法。基于指定某些灾难条件的假设的分析。分析结果在给定算法的相应灾难不可避免地,危险条件,安全条件和基本安全假设的正式表达式。基本安全假设对给定算法的环境建立了安全要求,并通过定性逻辑方式表征了算法的自身内部安全性。安全条件允许制作安全版本的初始算法。在分析简单的惯性算法期间引入和说明了所有概念和概念。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号