ScholarLens Back to search
2001•Electronic Notes in Theoretical Computer ScienceOpen access

Model Checking UML State Machines and Collaborations

Timm Schäfer, Alexander Knapp, Stephan Merz

Open full text 204 citations

Abstract

The Unified Modeling Language provides two complementary notations, state machines and collaborations, for the specification of dynamic system behavior. We describe a prototype tool, HUGO , that is designed to automatically verify whether the interactions expressed by a collaboration can indeed be realized by a set of state machines. We compile state machines into a PROMELA model and collaborations into sets of Büchi automata (“never claims”). The model checker SPIN is called upon to verify the model against the automata.

About this research paper

What this paper is about

The Unified Modeling Language provides two complementary notations, state machines and collaborations, for the specification of dynamic system behavior. We describe a prototype tool, HUGO , that is designed to automatically verify whether the interactions expressed by a collaboration can indeed be realized by a set of state machines. We compile state machines into a PROMELA model and collaborations into sets of Büchi automata (“never claims”). The model checker SPIN is called upon to verify the model against the automata.

Why it matters

OpenAlex reports 204 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The Unified Modeling Language provides two complementary notations, state machines and collaborations, for the specification of dynamic system behavior. We describe a prototype tool, HUGO , that is designed to automatically verify whether the interactions expressed by a collaboration can indeed be realized by a set of state machines. We compile state machines into a PROMELA model and collaborations into sets of Büchi automata (“never claims”). The model checker SPIN is called upon to verify the model against the automata.

Key concepts: Promela, Computer science, Programming language, Model checking, Finite-state machine, Automaton, State (computer science), Unified Modeling Language

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Model Checking UML State Machines and Collaborations — Research Paper | ScholarLens