Zpět na vyhledávání

Bc. Martin Chmelík

Master's thesis

Realizability of Message Sequence Graphs

Realizability of Message Sequence Graphs
Abstract:
V této práci jsme se zaměřili na problém realizovatelnosti Message Sequence Graphs, tedy zda je daná specifikace korektně distribuovatelná mezi paralelní komponenty. Obecně je tato otázka nerozhodnutelná. Proto se snažíme nalézt třídu specifikací Message Sequence Graphs, které jsou nejen realizovatelné, ale zároveň je rozhodnutelné, zda je daná specifikace prvkem této třídy. Navrhujeme novou třídu …more
Abstract:
In this work we focus on the realizability problem of Message Sequence Graphs, i.e., the problem whether a given specification is correctly distributable among parallel components. In the general setting, the problem is proved to be undecidable. Therefore, we search for a restricted class of Message Sequence Graphs that admits a realization, but moreover it is decidable whether a given specification …more
 

Keywords

Message Sequence Charts MSC basic Message Sequence Chart bMSC Message Sequence Graph MSG realization realizability Communicating Finite State Machines CFM.
 
Language used: English
Date on which the thesis was submitted / produced: 30. 5. 2011
Identifier: https://is.muni.cz/th/v8qfl/

Thesis defence

  • Date of defence: 28. 6. 2011
  • Supervisor: RNDr. Vojtěch Řehák, Ph.D.
  • Reader: Mgr. Václav Vacek

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Master programme / field:
Informatics / Parallel and Distributed Systems

Theses on a related topic

List of theses with an identical keyword.
All theses