Bc. Ľuboš Korenčiak

Master's thesis

Effective Algorithms for Time Relation Checking in Message Sequence Charts

Effective Algorithms for Time Relation Checking in Message Sequence Charts
Abstract:
SCStudio je užívateľsky prívetivý nástroj na kreslenie a overovanie UML sekvenčných diagramov a diagramov Message Sequence Chart (MSC). V súčasnej dobe SCStudio obsahuje neefektívne algoritmy pre prácu s časom. Tieto algoritmy sú založené na riešení Temporal Constraint Satisfaction Problem (TCSP). Táto diplomová práca poskytuje prehľad prístupov na efektívne riešenie TCSP. Z nich bol vybraný najvhodnejší …more
Abstract:
SCStudio is a user friendly drawing and verification tool for UML Sequence Diagrams and Message Sequence Charts. Currently SCStudio contains inefficient algorithms for working with time relations. These algorithms are based on solving of Temporal Constraint Satisfaction Problem (TCSP). This thesis provides a survey of approaches concerning with effective solving of TCSP. The most suitable approach …more
 
 
Language used: English
Date on which the thesis was submitted / produced: 30. 5. 2011

Thesis defence

  • Date of defence: 28. 6. 2011
  • Supervisor: RNDr. Vojtěch Řehák, Ph.D.
  • Reader: doc. Mgr. Jan Obdržálek, PhD.

Citation record

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

Masaryk University

Faculty of Informatics

Master programme / field:
Informatics / Parallel and Distributed Systems