Loading...

An Integrated Formal Method for Specification and Verification of Component-Based Systems

Izadi, Mohammad | 2009

629 Viewed
  1. Type of Document: Ph.D. Dissertation
  2. Language: Farsi
  3. Document No: 39031 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Movaghar Rahimabadi, Ali
  7. Abstract:
  8. This thesis presents an integrated formal method for modeling and model checking of component based computing systems. Both components and coordination subsystems are modeled by a variant of standard labeled transition systems called record transition systems. A record transition system is a labeled transition system whose transition labels are records. We use records to model the concurrency of input – output operations in the ports of the system. The concurrency of the executions with respect to common transition labels are modeled by standard parallel composition operator and also a new defined operator called join which is analogous to the join operator defined to compose constraint automata. All well defined composition operators of labeled transition systems and two new defined operators (join and hiding a port name in all records) can be used to compose record transition systems. To alleviate the state explosion problem we use two solutions: compositional reduction of the models using some equivalence relations and the abstraction technique. For compositional reduction of the models, we use equivalence relations CFFD (Chaos Free Failure Divergences) and NDFD (Non Divergent Failure Divergences) over record transition systems. We have shown that CFFD and NDFD are congruencies with respect to the new composition operators join and hiding of port names. Also it has been shown that NDFD and CFFD are the weakest equivalence relations that respectively preserve linear temporal logic without next operator (called ) and with an extra temporal operator distinguishing deadlocks (called ) with respect to the temporal semantics of record transition systems. The reduction algorithms have been modified such that they can be used for record transition systems. To use the abstraction method, first we define the notions of liveness, weak and strong fairness for record transition systems (and their constraint automata counterparts) and show that our defined fairness conditions satisfy the well known condition that says a fairness definition is acceptable if it satisfies the liveness condition. Then, we introduce an abstraction method both to reduce the sizes of models and to restrict the linear time temporal formulas to be proper for the abstracted models. We use automata theoretic model checking method to verify the properties of the systems. In this way, we introduce an action based linear temporal logic (called ALTL) over augmented record transition systems and an inductive algorithm to translate ALTL formulas into record transition systems (interpreted as Büchi automata whose all states are accepting). Also, we introduce on-the-fly version of the translation algorithm
  9. Keywords:
  10. Coordination Model ; Verification ; Model Cheking ; Abstraction ; Compositional Verification ; Component Based System

 Digital Object List

 Bookmark

No TOC