In theoretical computer science a bisimulation is a binary relation between state transition systems, associating systems which behave in the same way in the sense that one system simulates the other and vice-versa. Intuitively two systems are bisimilar if they match each other's moves. In this sense, each of the systems cannot be distinguished from the other by an observer.
more from Wikipedia
Probabilistic bisimulation
In theoretical computer science, probabilistic bisimulation is an extension of the concept of bisimulation for fully probabilistic transition systems first described by K.G. Larsen and A. Skou. A discrete probabilistic transition system is a triple where gives the probability of starting in the state s, performing the action a and ending up in the state t. The set of states is assumed to be countable. There is no attempt to assign probabilities to actions.
more from Wikipedia
Reactive system
A reactive system is a system that responds (reacts) to external events. Typically, biological systems are reactive, because they react to certain events. However, the term is used primarily for describing human-made systems. For example, a light consisting of a bulb and a switch is a reactive system, reacting to the user changing the switch position.
more from Wikipedia
Descriptive complexity theory
Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic needed to express the languages in them. For example, PH, the union of all complexity classes in the polynomial hierarchy, is precisely the class of languages expressible by statements of second-order logic.
more from Wikipedia
Continuous function
In mathematics, a continuous function is a function for which, intuitively, "small" changes in the input result in "small" changes in the output. Otherwise, a function is said to be "discontinuous". A continuous function with a continuous inverse function is called "bicontinuous". Continuity of functions is one of the core concepts of topology, which is treated in full generality below.
more from Wikipedia
Theorem
In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements, such as axioms. The derivation of a theorem is often interpreted as a proof of the truth of the resulting expression, but different deductive systems can yield other interpretations, depending on the meanings of the derivation rules.
more from Wikipedia