On the performance of UML state machine interpretation at runtime
Proceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
| Hi-index | 0.00 |
This paper initiates an algorithmic investigation of higraphs, a formalism proposed in 1988 that combines and extends graphs and Euler/Venn diagrams. We first provide higraphs with a syntax and semantics that minimize ambiguities in the interpretation. We then consider some basic properties of higraphs, such as shortest paths, Hamiltonian cycles, bipartition, and minimum cover, and seek algorithms to test for them. In some cases, like shortest paths, the algorithms and the bounds from graphs can be generalized to higraphs, but in others, such as Hamiltonian cycles, the situation is not as clear.