- ホーム
- > 洋書
- > 英文書
- > Computer / General
Full Description
With the rapid growth of networking and high-computing power, the demand for large-scale and complex software systems has increased dramatically. Many of the software systems support or supplant human control of safety-critical systems such as flight control systems, space shuttle control systems, aircraft avionics control systems, robotics, patient monitoring systems, nuclear power plant control systems, and so on. Failure of safety-critical systems could result in great disasters and loss of human life. Therefore, software used for safety critical systems should preserve high assurance properties. In order to comply with high assurance properties, a safety-critical system often shares resources between multiple concurrently active computing agents and must meet rigid real-time constraints. However, concurrency and timing constraints make the development of a safety-critical system much more error prone and arduous. The correctness of software systems nowadays depends mainly on the work of testing and debugging. Testing and debugging involve the process of de tecting, locating, analyzing, isolating, and correcting suspected faults using the runtime information of a system. However, testing and debugging are not sufficient to prove the correctness of a safety-critical system. In contrast, static analysis is supported by formalisms to specify the system precisely. Formal verification methods are then applied to prove the logical correctness of the system with respect to the specification. Formal verifica tion gives us greater confidence that safety-critical systems meet the desired assurance properties in order to avoid disastrous consequences.
Contents
1. Introduction.- 1. Background.- 2. State Explosion.- 3. Compositional Verification.- 4. A Compositional Verification Methodology.- 5. Reduction Methods for Real-Time Systems.- 2. Verification Techniques for Concurrent Systems.- 1. Techniques for Efficient Analysis of Concurrent Systems.- 2. Compositional-Verification Techniques.- 3. Petri-Net Based Techniques for Real-Time Systems.- 3. Multiset Labeled Transition Systems.- 1. The Model.- 2. Communication Diagrams.- 3. Function "Parallel Composition" (?) of MLTSs.- 4. Function "Hiding Invisible Actions (Hide)" of MLTSs.- 5. Parallel Operation of MLTSs.- 4. Compositional Verification Using MLTS.- 1. Equivalences, Synonyms, and Congruences.- 2. Paths, Traces, and IO-Traces.- 3. IOT-Failures-Divergence (IOTFD) Equivalence.- 4. IOTFD-Equivalence Reduction.- 5. Algorithms and Proofs.- 5. Composotional Verification Using Petri Nets.- 1. The Models.- 2. Function "Parallel Composition".- 3. Synonymous Reduction.- 4. Compositional Verification of Condensed MLTSs.- 5. Condensation Theories for State-Based Systems.- 6. Condensation Rules for IOT-State/IOT-Failure Equivalences.- 7. Firing Dependence Theories and Rules for MLTS*s.- 8. Compositional Verification of Sub-Marking Reachability.- 9. Definitions, Algorithms, and Proofs.- 6. Tools and Experiments.- 1. Alternating Bit Protocol (ABP).- 2. Tools.- 3. Performance Evaluation.- 7. Delay Time Petri Nets and Net Reduction.- 1. Time Petri Nets.- 2. Delay Time Petri Nets (DTPNs).- 3. Reduction Rules for DTPNs.- 4. Class Graphs of DTPNs.- 5. Efficiency Consideration and Experimental Results.- References.
