CSL-LICS '14 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
In control systems engineering, a state variable is one of the set of variables that are used to describe the mathematical "state" of a dynamical system. Intuitively, the state of a system describes enough about the system to determine its future behaviour. Models that consist of coupled first-order differential equations are said to be in state-variable form
more from Wikipedia
Energy
In physics, energy is an indirectly observed quantity. It is often understood as the ability a physical system has to do work on other physical systems. Since work is defined as a force acting through a distance (a length of space), energy is always equivalent to the ability to exert pulls or pushes against the basic forces of nature, along a path of a certain length. The total energy contained in an object is identified with its mass, and energy (like mass), cannot be created or destroyed.
more from Wikipedia
Undecidable problem
In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct a single algorithm that always leads to a correct yes-or-no answer. A decision problem is any arbitrary yes-or-no question on an infinite set of inputs. Because of this, it is traditional to define the decision problem equivalently as the set of inputs for which the problem returns yes.
more from Wikipedia
Pushdown automaton
In automata theory, a pushdown automaton (PDA) is a variation of finite automaton that can make use of a stack containing data.
more from Wikipedia
Preorder
In mathematics, especially in order theory, a preorder or quasi-order is a binary relation that is reflexive and transitive. All partial orders and equivalence relations are preorders, but preorders are more general. The name 'preorder' comes from the idea that preorders are 'almost' (partial) orders, but not quite; they're neither anti-symmetric nor symmetric. Because a preorder is a binary relation, the symbol ¿ can be used as the notational device for the relation.
more from Wikipedia
Decidability (logic)
In logic, the term decidable refers to the decision problem, the question of the existence of an effective method for determining membership in a set of formulas, or, more precisely, an algorithm that can and will return a Boolean true or false value (instead of looping indefinitely). Logical systems such as propositional logic are decidable if membership in their set of logically valid formulas (or theorems) can be effectively determined.
more from Wikipedia
Tuple
In mathematics and computer science, a tuple is an ordered list of elements. In set theory, an (ordered) -tuple is a sequence (or ordered list) of elements, where is a positive integer. There is also one 0-tuple, an empty sequence. An -tuple is defined inductively using the construction of an ordered pair. Tuples are usually written by listing the elements within parentheses "" and separated by commas; for example, denotes a 5-tuple.
more from Wikipedia
Automaton
An automaton is a self-operating machine. The word is sometimes used to describe a robot, more specifically an autonomous robot. An alternative spelling, now obsolete, is automation.
more from Wikipedia