We describe a prototype tool, hugo/RT, that is designed to automatically verify whether the timed state machines in a UML model interact according to scenarios specified by time-annotated UML collaborations. Timed state machines are compiled into timed automata that exchange signals and operations via a network automaton. A collaboration with time constraints is translated into an observer timed automaton. The model checker uppaal is called upon to verify the timed automata representing the model against the observer timed automaton.
CITATION STYLE
Knapp, A., Merz, S., & Rauh, C. (2002). Model checking timed UML state machines and collaborations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2469, pp. 395–414). Springer Verlag. https://doi.org/10.1007/3-540-45739-9_23
Mendeley helps you to discover research relevant for your work.