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 can be represented as directed graphs.
Wikipage disambiguates
Abstract rewriting systemAction languageAverestBell–LaPadula modelBiba ModelBisimulationBusiness Process Execution LanguageCalculus of communicating systemsCommunicating sequential processesComputation tree logicDatabase stateDeterministic finite automatonF-coalgebraFDR (software)Finite-state machineFormal verificationFrame problemGlossary of artificial intelligenceHennessy–Milner logicHidden algebraKripke semanticsKripke structure (model checking)LTSLTSALTSSLabeled Transition SystemLabeled transition systemLabelled transition systemList of computability and complexity topicsList of functional programming topicsModal μ-calculusModel-based testingMonoidOperational semanticsPartial order reductionPetri netPost's theoremProbabilistic bisimulationProgramming in the large and programming in the smallQuantum Turing machine
Link from a Wikipage to another Wikipage
primaryTopic
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 can be represented as directed graphs.
has abstract
Ein Transitionssystem (englisc ...... s Konstrukt angewendet werden.
@de
En informatique théorique, un ...... ons sont des graphes orientés.
@fr
In informatica teorica un sist ...... esentati come grafi orientati.
@it
In theoretical computer scienc ...... epresented as directed graphs.
@en
Na teoria da ciência da comput ...... ados como grafos direcionados.
@pt
Přechodový systém je v teoreti ...... ) a „neoznačené“ (unlabelled).
@cs
Модель станів і переходів — аб ...... дів: марковані та немарковані.
@uk
يعرّف نظام حالة انتقال في المع ...... نظام حالة-انتقال كـبيان موجه.
@ar
在计算机科学和控制理论中,“变迁系统”用数学的方法描述离散系 ...... 态;
* 变迁系统可以表示为有向图,有限状态自动机则不能。
@zh
状態遷移系(じょうたいせんいけい、State Transit ...... ラベル付き」と「ラベル無し」の2種類に分類することができる。
@ja
Wikipage page ID
10,768,144
page length (characters) of wiki page
Wikipage revision ID
1,002,923,358
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
Ein Transitionssystem (englisc ...... chter überprüft werden können.
@de
En informatique théorique, un ...... ons sont des graphes orientés.
@fr
In informatica teorica un sist ...... ette le etichette è possibile.
@it
In theoretical computer scienc ...... epresented as directed graphs.
@en
Na teoria da ciência da comput ...... ados como grafos direcionados.
@pt
Přechodový systém je v teoreti ...... ) a „neoznačené“ (unlabelled).
@cs
Модель станів і переходів — аб ...... у вигляді орієнтованих графів.
@uk
يعرّف نظام حالة انتقال في المع ...... نظام حالة-انتقال كـبيان موجه.
@ar
在计算机科学和控制理论中,“变迁系统”用数学的方法描述离散系 ...... 态;
* 变迁系统可以表示为有向图,有限状态自动机则不能。
@zh
状態遷移系(じょうたいせんいけい、State Transit ...... ラベル付き」と「ラベル無し」の2種類に分類することができる。
@ja
label
Přechodový systém
@cs
Sistema a transizione di stati
@it
Sistema de Transição
@pt
Système de transition d'états
@fr
Transition system
@en
Transitionssystem
@de
Модель станів і переходів
@uk
نظام حالة الانتقال
@ar
变迁系统
@zh
状態遷移系
@ja