Dissertation > Excellent graduate degree dissertation topics show

Research on Temporal Logic to Assertion Graphs

Author: LinLiXiu
Tutor: YangGuoWu
School: University of Electronic Science and Technology
Course: Computer Software and Theory
Keywords: model checking LTL CTL assertion graphs GSTE
CLC: TP301.2
Type: Master's thesis
Year: 2013
Downloads: 7
Quote: 0
Read: Download Dissertation

Abstract


With the successful application of Internet and Embed System in system such ascar/airplane and other safety systems,it seems that the dependence on computerdevice’s function will be more and more obvious.In fact,the pace of changing like thiswill be more and more fast.Because of rapid growth of technology,the reliable methodof developing verification system are becoming more and more important.the validmethods for verifying complexity system include simulation verification,testingverification and formal verification.Former two verification methods take a long timeand are difficult to use,what’s more,their unablity to handle all possible inputs andpotential bugs is fatal.Formal verification verify whether a system satisfies design bymathematic methodology which makes sure the absolute covery of test case. Modelchecking is a formal verification technology used to verify finite state concurrentsystem.In model checking,models are built firstly,and are used to check if they satisfythe specification.Temporal logic such as CTL and LTL is commonly used asspecification language,model checking based on temporal logic has already usedwidely in industry.GSTE is a efficiently automatic model checking algorithm,whichuses assertion graphs as its specification language.Assertion graphs is easily to usedcomparing with temporal logic,and model and properties of GSTE are both executedconcurrently.In conclusion,It’s practical converting temporal logic to assertion graphs.The paper starts with basic concepts of formal methods,comparing temporal logicwith assertion graphs and extending assertion graphs.Extending verification algorithmis proposed on extent of the paper,aiming at the capacity of verifying extendingassertion graphs.In this paper, formal methods and model checking are firstly introduced, and thenresearch significance is given. Secondly after an adequate introduction to verificationof GSTE, assertion graphs, its specification language, are introduced.Thirdly,weintroduce LTL, CTL and model checking algorithm based on them and compare CTLwith LTL and GSTE with model checking algorithm based on CTL,convert temporallogic to assertion graphs,illustrate limitation of assertion graphs between convention.We define terminate based on concepts in GSTE and terminate assertiongraphs based on assertion graphs and extend algorithm in GSTE and proposeterminately satisfy model checking algorithm aiming at the capacity of handlingextending assertion graphs,and prove the correction of algorithm.At last,computingprocess are shown by verifying if a model satisfyies properties.

Related Dissertations

  1. Research on the Methods for Detecting Mismatch of Web Services Based on Bounded Model Checking,TP311.52
  2. Research on Verification of Web Service Based on Abstraction Refinement and Combination Technology,TP311.52
  3. Software Testing and Reliability Computing Based on Model Rebuilding,TP311.53
  4. Optimization Research of Purchasing Decision Considering Multiple Transport Alternatives,F274
  5. Study on the Development Mode of Road Less-than-carload,U492.3
  6. Research on UML Modeling and Model Checking of CTCS-3 Train Control System,TP273
  7. Design and Implementation Automatic Analyzer for Security Protocol,TP393.08
  8. Research on Security of E-Commerce Protocols Based on UPPAAL,TP393.08
  9. Enhanced Anti-tumor Immune Effect and Mechanisms of TLR2 Agonist BLP,R730.3
  10. Prediction and Identification of HLA-A2/A3 Restricted CTL Epitopes Derived from MAGE-4,R392
  11. Buffer Overflow Vulnerabilities Detection System Based on Constraint System Model,TP393.08
  12. Research and Implement on Static Malware Detection System Based on Program Semantics,TP393.08
  13. The Correlation of Tumor Immune Microenvironment in Pancreatic Cancer between Clinicopathologic and Prognostic Outcomes,R735.9
  14. Expression Level and Clinical Significance of PD-1 and Tim-3 in Human Immunodeficiency Virus-1 Infected Individuals,R512.91
  15. Allogeneic Platelet MHC I Antigens Prevent CD61 Specific Cytotoxic T Cell (CTL)-Mediated Immune Thrombocytopenia (ITP),R392
  16. Effects of Different Adjuvants on CTL Immune Response Induced by OVA,R392
  17. Formal Analysis for Train Control System Based on Runtime Verification,TP273
  18. Compositional Verification Through Learning and Assume-Guarantee Rules,TP311.52
  19. Design and Formal Verification of Asynchronous FIFO,TN02
  20. A Qualitative Study of Simian Immunodeficiency Virus Model,O175.13
  21. Study on Tumor-Killing Cells Induced by Tumor Soluble Antigen and Staphylococcus Enterotoxin Superantigen,R73-36

CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > General issues > Theories, methods > Formal language theory
© 2012 www.DissertationTopic.Net  Mobile