Mgr. Petr Slovák
Bachelor's thesis
Race Conditions in Message Sequence Charts
Race Conditions in Message Sequence Charts
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 …more
Language used: English
Date on which the thesis was submitted / produced: 22. 5. 2008
Identifier:
https://is.muni.cz/th/lr0r9/
Thesis defence
- Date of defence: 26. 6. 2008
- Supervisor: RNDr. Vojtěch Řehák, Ph.D.
- Reader: doc. Mgr. Radek Pelánek, Ph.D.
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 informatikyMasaryk University
Faculty of InformaticsBachelor programme / field:
Informatics / Informatics
Theses on a related topic
-
Deciding Non-local Choice in High-level Message Sequence Charts
Martin Chmelík -
Probabilistic Extension of Message Sequence Chart
Martin Křivánek -
Time Extension of Message Sequence Chart
Ľuboš Korenčiak -
Message Sequence Chart Properties and Checking Algorithms
Jindřich Babica -
Layout Configuration for Message Sequence Charts
Milan Malota -
Effective Algorithms for Time Relation Checking in Message Sequence Charts
Ľuboš Korenčiak -
Deciding Non-local Choice in High-level Message Sequence Charts
Martin Chmelík -
Nástroje pro práci s message sequence charts
Martin Zavadil