Simulation Preorder
Get Simulation Preorder essential facts below. View Videos or join the Simulation Preorder discussion. Add Simulation Preorder to your PopFlock.com topic list for future reference or share this resource on social media.
Simulation Preorder

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

Intuitively, a system simulates another system if it can match all of its moves.

The basic definition relates states within one transition system, but this is easily adapted to relate two separate transition systems by building a system consisting of the disjoint union of the corresponding components.

## Formal definition

Given a labelled state transition system (S, ?, ->), a simulation relation is a binary relation R over S (i.e. R ? S × S) such that for every pair of elements (p,q) ? R, for all ? ? ?, and for all p' ? S,

${\displaystyle p{\overset {\alpha }{\rightarrow }}p'}$

implies that there is a q' ? S such that

${\displaystyle q{\overset {\alpha }{\rightarrow }}q'}$

and (p',q') ? R.

Equivalently, in terms of relational composition:

${\displaystyle R^{-1}\,;{\overset {\alpha }{\rightarrow }}\quad {\subseteq }\quad {\overset {\alpha }{\rightarrow }}\,;R^{-1}}$

Given two states p and q in S, q simulates p, written p preorder, and is usually called the simulation preorder. It is the largest simulation relation over a given transition system.

Two states p and q are said to be similar, written p = q, if p simulates q and q simulates p. Similarity is an equivalence relation, but it is coarser than bisimilarity.

## Similarity of separate transition systems

When comparing two different transition systems (S', ?', ->') and (S", ?", ->"), the basic notions of simulation and similarity can be used by forming the disjoint composition of the two machines, (S, ?, ->) with S = S' ? S", ? = ?' ? ?" and -> = ->' ? ->", where ? is the disjoint union operator between sets.

## References

1. Park, David (1981). "Concurrency and Automata on Infinite Sequences" (PDF). In Deussen, Peter (ed.). Proceedings of the 5th GI-Conference, Karlsruhe. Lecture Notes in Computer Science. 104. Springer-Verlag. pp. 167-183. doi:10.1007/BFb0017309. ISBN 978-3-540-10576-3.
2. Milner, Robin (1989). Communication and Concurrency. Prentice Hall. ISBN 0-13-114984-9.
3. van Glabbeek, R. J. (2001). "The Linear Time - Branching Time Spectrum I: The Semantics of Concrete, Sequential Processes". Handbook of Process Algebra. Elsevier. pp. 3-99.

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.