An Execution Algorithm for UML Activity Graphs

H. Eshuis, Roelf J. Wieringa

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    14 Citations (Scopus)


    We present a real-time execution semantics for UML activity graphs that is intended for workflow modelling. The semantics is defined in terms of execution algorithms that define how components of a workflow system execute an activity graph. The semantics stays close to the semantics of UML state machines, but differs from it in some minor points. Our semantics deals with real time. The semantics provides a basis for verification of UML activity graphs, for example using model checking, and also for executing UML activity graphs using simulation tools. We illustrate an execution by means of a small example.
    Original languageUndefined
    Title of host publication4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools (UML 2001)
    EditorsMartin Gogolla, Cris Kobryn
    Place of PublicationBerlin/Heidelberg, Germany
    Number of pages15
    ISBN (Print)978-3-540-42667-7
    Publication statusPublished - Oct 2001
    EventModeling Languages, Concepts and Tools 4th International Conference: The Unified Modeling Language, Modeling Languages, Concepts and Tools - Toronto, Canada
    Duration: 1 Oct 20015 Oct 2001

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    ConferenceModeling Languages, Concepts and Tools 4th International Conference
    CityToronto, Canada


    • IR-61809
    • SCS-Services
    • EWI-10536
    • METIS-204959

    Cite this