Loading...

A Formal Semantic for Probabilistic Reo Connectors Using Büchi Automata of Records

Abedi, Hajar | 2013

594 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 44857 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Izadi, Mohammad
  7. Abstract:
  8. The purpose of this dissertation is proposing a probabilistic model in transition systems of records. In these systems, two acceptance state of finite and infinite string have proposed which acceptance state of finite string is called probabilistic finite automata of records and acceptance state of infinite string is called probabilistic buchi automata of records. The buchi automata of records is an operational semantic for Reo coordination language. Reo is a coordination language to coordinate existing component of a component based system. Reo circuits with non-deterministic and probabilistic channel can be modeled by proposing probabilistic buchi automata of records. In this dissertation we are going to propose probabilities for transition system of records in three levels. First, we are defining deterministic probabilistic records transition system (DPRTS). In mentioned systems, there exists at most a probabilistic distribution for a specificrecord in each state. Then, non-deterministic probabilistic records transition systems are introduced. In this system, model is extended with probabilistic in two non-deterministic levels. In first level, simple non-deterministic probabilistic records transition system considers the probability for next configuration. Then in second level, the next configuration is determined by applying probability on input and output operators
  9. Keywords:
  10. Reo Modeling Language ; Coordination Model ; Probabilistic Buchi Automata ; Buchi Outomata ; Component Based System ; Coordinator

 Digital Object List

 Bookmark

No TOC