Model Checking of Component Connectors Using Equivalence Relations

Please enable javascript in your browser.

Bashari, Mahdi | 2009

544 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 39561 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Movaghar Rahimabadi, Ali
Abstract:
In this thesis, we propose a method for verifing software component connectors. In this method, correctness of specification expressed using Linear Temporal Logic (LTL) will be checked on component connectors of Reo coordination model using Model Checking on Constraint Automata which is the behavioral model proposed for Reo connectors. Since model checking suffers from State Explosion Problem as the size of model increases, we reduce the impact of this problem using two techniques: using equivalence relations and implementing using Binary Decision Diagrams (BDDs). We find the smallest equivalent of our behavioral model according to CFFD equivalence which is weakest equivalence preserving nexttimeless LTL and liveness properties. And by defining symbolic constraint automata and symbolic CFFD reduction algorithm and model checking, we implement all course of model checking method using Binary Decision Diagram.At the end, we give some examples for showing efficiency of our method
Keywords:
Coordination Model ; Reo Modeling Language ; Model Cheking ; Constraint Automata ; Equivalence Relations ; Binary Descision Making Diagram

No TOC