Système de transition d'états

Domaine

Intelligence artificielle
Coulombe

Français

Discussion:

Pour le moment, le terme privilégié est «système à transition d'états».

En intelligence artificielle et en informatique théorique, un système à transition d'états est un concept utilisé dans l'étude du calcul de systèmes discrets. Un système à transition d'états comporte des états et des transitions entre états, qui peuvent être étiquetés.

Anglais

Transition system

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: