Visualisation of state machines using the Sugiyama framework

Visa enkel post
dc.contributor.authorMazetti, Viktor
dc.contributor.authorSörensson, Hannes
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T12:54:42Z
dc.date.available2019-07-03T12:54:42Z
dc.date.issued2012
dc.description.abstractIn this thesis a tool was developed to help Ericsson visualise state machines. In this process an evaluation of graph layout algorithms within the Sugiyama framework, a suitable method for drawing state machine diagrams, was conducted. The framework consists of four steps which are implemented and tested according to some chosen criteria for graph layouts. The steps are also tested in relation to each other so as to see if an algorithm used in one step can impact the quality of the solution for subsequent steps. Interestingly enough we saw that a seemingly worse performing algorithm in one step could actually improve the quality of the next step. We discuss these results and suggest that future work is needed to investigate if there are some properties of a graph that can indicate how well subsequent steps can perform.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/161388
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectDatavetenskap (datalogi)
dc.subjectComputer and Information Science
dc.subjectComputer Science
dc.titleVisualisation of state machines using the Sugiyama framework
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
Ladda ner
Original bundle
Visar 1 - 1 av 1
Bild (thumbnail)
Namn:
161388.pdf
Storlek:
1.28 MB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext
Ladda ner
Samling
Examensarbeten för masterexamen