- Applied mathematics
- >
- Mathematical modeling
- >
- Models of computation
- >
- Transition systems

- Mathematics of computing
- >
- Formal methods
- >
- Model checking
- >
- Transition systems

- Mathematics of computing
- >
- Formal methods
- >
- Models of computation
- >
- Transition systems

- Model theory
- >
- Finite model theory
- >
- Model checking
- >
- Transition systems

- Theoretical computer science
- >
- Formal methods
- >
- Model checking
- >
- Transition systems

- Theoretical computer science
- >
- Formal methods
- >
- Models of computation
- >
- Transition systems

- Theoretical computer science
- >
- Theory of computation
- >
- Models of computation
- >
- Transition systems

Stutter bisimulation

In theoretical computer science, a stutter bisimulation is defined in a coinductive manner, as is bisimulation.Let TS=(S,Act,→,I,AP,L) be a transition system. A stutter bisimulation for TS is a binary

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

Simulation (computer science)

In theoretical computer science a simulation is a relation between state transition systems associating systems that behave in the same way in the sense that one system simulates the other. Intuitivel

Bisimulation

In theoretical computer science a bisimulation is a binary relation between state transition systems, associating systems that behave in the same way in that one system simulates the other and vice ve

Kripke structure (model checking)

A Kripke structure is a variation of the transition system, originally proposed by Saul Kripke, used in model checking to represent the behavior of a system.It consists of a graph whose nodes represen

© 2023 Useful Links.