Transition system

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In theoretical computer science, a transition system is a state machine that may have infinite states. 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.

In theoretical computer science, a transition system is a state machine that may have infinite states. 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.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1347117300 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001347117300 · captured 1775326686.0 · version history

Cite this page as: encyclopegia.org, “Transition system”, snapshot enwiki-001347117300. https://encyclopegia.org/a/transition-system

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.