Race Conditions in Message Sequence Charts

Mgr. Petr Slovák

Bakalářská práce

Abstract:

Race condition problem is known to be decidable for Message Sequence Charts (MSC) but it becomes undecidable for High-level MSC. This thesis introduces a modification of the race condition problem, so called trace race condition problem, that remains decidable even for High-level MSC (with coregions). In this thesis, we discuss differences between the race condition and the trace race condition problem and we argue that our concept is useful in model based design. We also propose an algorithm solving the trace race condition problem as well as show the problem itself to be NP-complete for HMSC with coregions.

Keywords

Message Sequence Charts, High-level Message Sequence Charts, race conditions, trace race conditions

Jazyk práce: angličtina

Datum vytvoření / odevzdání či podání práce: 22. 5. 2008

Obhajoba závěrečné práce

• Obhajoba proběhla 26. 6. 2008
• Vedoucí: RNDr. Vojtěch Řehák, Ph.D.
• Oponent: doc. Mgr. Radek Pelánek, Ph.D.

Masarykova univerzita

Fakulta informatiky

Bakalářský studijní program / obor:
Informatika / Informatika