Transition system

This article is about transition systems as used in operational semantics. For an automata-theoretic view, see semiautomaton.

In theoretical computer science, a transition system is a concept used in the study of computation. It is used to describe the potential behavior of discrete systems. It consists of states and transitions between states, which may be labeled with labels chosen from a set; the same label may appear on more than one transition. If the label set is a singleton, the system is essentially unlabeled, and a simpler definition that omits the labels is possible.

Transition systems coincide mathematically with abstract rewriting systems (as explained further in this article) and directed graphs. They differ from finite-state automata in several ways:

• The set of states is not necessarily finite, or even countable.
• The set of transitions is not necessarily finite, or even countable.
• No "start" state or "final" states are given.

Transition systems can be represented as directed graphs.

Formal definition

Formally, a transition system is a pair $(S,T)$ where $S$ is a set of states and $T$, the transition relation, is a subset of $S\times S$. We say that there is a transition from state $p$ to state $q$ iff $(p,q)\in T$, and denote it $p\rightarrow q$.

A labelled transition system is a tuple $(S,\Lambda ,T)$ where $S$ is a set of states, $\Lambda$ is a set of labels, and $T$, the labelled transition relation, is a subset of $S\times \Lambda \times S$. We say that there is a transition from state $p$ to state $q$ with label $\alpha$ iff $(p,\alpha ,q)\in T$ and denote it

$p\xrightarrow {\alpha } q\,.$

Labels can represent different things depending on the language of interest. Typical uses of labels include representing input expected, conditions that must be true to trigger the transition, or actions performed during the transition. Labelled transitions systems were originally introduced as named transition systems.

Special cases

• If, for any given $p$ and $\alpha$, there exists only a single tuple $(p,\alpha ,q)$ in $T$, then one says that $\alpha$ is deterministic (for $p$).
• If, for any given $p$ and $\alpha$, there exists at least one tuple $(p,\alpha ,q)$ in $T$, then one says that $\alpha$ is executable (for $p$).

Coalgebra formulation

The formal definition can be rephrased as follows. Labelled state transition systems on $S$ with labels from $\Lambda$ correspond one-to-one with functions $S\to {\mathcal {P}}(\Lambda \times S)$, where ${\mathcal {P}}$ is the (covariant) powerset functor. Under this bijection $(S,\Lambda ,T)$ is sent to $\xi _{T}:S\to {\mathcal {P}}(\Lambda \times S)$, defined by

$p\mapsto \{\,(\alpha ,q)\in \Lambda \times S\mid p\xrightarrow {\alpha } q\,\}$.

In other words, a labelled state transition system is a coalgebra for the functor $P(\Lambda \times {-})$.

Relation between labelled and unlabelled transition system

There are many relations between these concepts. Some are simple, such as observing that a labelled transition system where the set of labels consists of only one element is equivalent to an unlabelled transition system. However, not all these relations are equally trivial.

Comparison with abstract rewriting systems

As a mathematical object, an unlabeled transition system is identical with an (unindexed) abstract rewriting system. If we consider the rewriting relation as an indexed set of relations, as some authors do, then a labeled transition system is equivalent to an abstract rewriting system with the indices being the labels. The focus of the study and the terminology are different, however. In a transition system one is interested in interpreting the labels as actions, whereas in an abstract rewriting system the focus is on how objects may be transformed (rewritten) into others.

Extensions

In model checking, a transition system is sometimes defined to include an additional labeling function for the states as well, resulting in a notion that encompasses that of Kripke structure.

Action languages are extensions of transition systems, adding a set of fluents F, a set of values V, and a function that maps F × S to V.

See also

• Binary relation
• Ternary relation
• Transition monoid
• Transformation monoid
• Semigroup action
• Simulation preorder
• Bisimulation
• Operational semantics
• Kripke structure
• Finite-state machine
• Modal μ-calculus