Compositional Verification of Concurrent and Real-Time Systems

1. Front Matter

   Pages i-xix

   PDF

2. Introduction

   • Eric Y. T. Juan, Jeffrey J. P. Tsai

   Pages 1-6

3. Verification Techniques for Concurrent Systems

   • Eric Y. T. Juan, Jeffrey J. P. Tsai

   Pages 7-15

4. Multiset Labeled Transition Systems

   • Eric Y. T. Juan, Jeffrey J. P. Tsai

   Pages 17-27

5. Compositional Verification Using MLTS

   • Eric Y. T. Juan, Jeffrey J. P. Tsai

   Pages 29-81

6. Compositional Verification Using Petri Nets

   • Eric Y. T. Juan, Jeffrey J. P. Tsai

   Pages 83-128

7. Tools and Experiments

   • Eric Y. T. Juan, Jeffrey J. P. Tsai

   Pages 129-142

8. Delay Time Petri Nets and Net Reduction

   • Eric Y. T. Juan, Jeffrey J. P. Tsai

   Pages 143-186

9. Back Matter

   Pages 187-196

   PDF

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.

• distributed systems
• embedded systems
• formal method
• formal methods
• formal verification
• modeling
• real-time system
• reliability
• robot
• robotics
• safety-critical system
• software
• verification

• Department of Information and Computer Engineering, Chung Yuan Christian University, Chung Li, Taiwan

  Eric Y. T. Juan

• Department of Computer Science, University of Illinois at Chicago, Chicago, USA

  Jeffrey J. P. Tsai

Policies and ethics