1 / 37

Verification of Linear Real-Time Logic Specifications

This paper explores verification techniques for Linear Real-Time Logic (RTL) specifications, emphasizing the verification of timing properties in real-time systems. We discuss decidable fragments of RTL, their limitations, and demonstrate the application of these theories with a specification of a phased array radar system utilizing four antennas. The methodology outlined includes translation into LRTL, analysis of propositional clauses, and the complexities involved in the verification process. Additionally, we compare existing tools and present experimental results highlighting the efficacy of our approach.

nayef
Télécharger la présentation

Verification of Linear Real-Time Logic Specifications

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Verification of Linear Real-Time Logic Specifications

  2. Introduction

  3. Verifying timing properties

  4. Real-Time Logic (RTL)

  5. Real-Time Logic (cont)

  6. Decidable Fragments of RTL

  7. The previous classes

  8. Examples

  9. Limitations

  10. The specification of a phased array radar system with four antennas

  11. Translation to RTL

  12. Our larger class - LRTL

  13. Linear inequalities – an open problem

  14. Can we still re-use the constraint graph?

  15. LRTL

  16. The LRTL normal form

  17. The first 3 steps to prove SP  SA

  18. Example

  19. Step 4: Positive propositional clauses

  20. Step 5: Obtaining the negative propositional clauses

  21. Definition: Negative linear dependencies

  22. Theorem: Negative Linear Dependency

  23. Correctness Theorem

  24. Example

  25. Negative propositional clauses

  26. Step 6: The final step of our method

  27. Complexity considerations

  28. Comparison with similar works

  29. Differences between the three tools

  30. Differences between the three tools

  31. Experimental Results – Table 1

  32. Related and future work 1

  33. Related and future work 2

  34. Related and future work 3

  35. Future work 4

  36. S. Andrei and A. M. K. Cheng, “Verifying Linear Real-Time Logic Specifications,” IEEE-CS Real-Time Systems Symposium, Tucson, Arizona, December 2007.

  37. Thank you for your attention! Questions?

More Related