Chapter 3. Core Concepts

Table of Contents

Introduction
Definitions
Sarasvati Graph Execution
Legend
Single Node
Two Nodes
Split and Join with Wait States
Multithreading
Split and Join without Wait States
Flow Control with Guards using Skip
Flow Control with Guards using Discard
Flow Control with Guards using Named Arcs
Flow Control from Node Completion using Named Arcs
Graph Composition and Nested Processes
Graph Composition Example One
Graph Composition Example Two
Nested Processes Example
Execution Environment
Process Attributes
Token Attributes

Introduction

Graph based workflow/business process management engines are common. They have areas of commonality, but they also vary greatly in concept and implementation. For example, there are differences in how concurrency and synchronization are modeled and in how modularity and re-use are promoted.

We begin with the some definitions, move on to features likely to be common across most engines, then explain Sarasvati specifics.