State transition system in the context of Directed graph

State transition system in the context of Directed graph

State transition system Study page number 1 of 1

Play TriviaQuestions Online!

 or

Skip to study material about State transition system in the context of "Directed graph"

⭐ Core Definition: State 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:

↓ Menu
HINT:

In this Dossier

State transition system in the context of Action language

In computer science, an action language is a language for specifying state transition systems, and is commonly used to create formal models of the effects of actions on the world. Action languages are commonly used in the artificial intelligence and robotics domains, where they describe how actions affect the states of systems over time, and may be used for automated planning.

Action languages fall into two classes: action description languages and action query languages. Examples of the former include STRIPS, PDDL, Language A (a generalization of STRIPS; the propositional part of Pednault's ADL), Language B (an extension of A adding indirect effects, distinguishing static and dynamic laws) and Language C (which adds indirect effects also, and does not assume that every fluent is automatically "inertial"). There are also the Action Query Languages P, Q and R. Several different algorithms exist for converting action languages, and in particular, action language C, to answer set programs. Since modern answer-set solvers make use of boolean SAT algorithms to very rapidly ascertain satisfiability, this implies that action languages can also enjoy the progress being made in the domain of boolean SAT solving.

View the full Wikipedia page for Action language
↑ Return to Menu
LINKED FROM (PARENTS)
← Action language
LINKS TO (CHILDREN)
Theoretical computer science → Computation → Discrete system → State (computer science) → Singleton (mathematics) → Abstract rewriting system → Directed graph → Finite-state automata →