Symbolic simulation

In computer science, a simulation is a computation of the execution of some appropriately modelled state-transition system. Typically this process models the complete state of the system at individual points in a discrete linear time frame, computing each state sequentially from its predecessor. Models for computer programs or VLSI logic designs can be very easily simulated, as they often have an operational semantics which can be used directly for simulation.

Symbolic simulation is a form of simulation where many possible executions of a system are considered simultaneously. This is typically achieved by augmenting the domain over which the simulation takes place. A symbolic variable can be used in the simulation state representation in order to index multiple executions of the system.^[1] For each possible valuation of these variables, there is a concrete system state that is being indirectly simulated.

Because symbolic simulation can cover many system executions in a single simulation, it can greatly reduce the size of verification problems. Techniques such as symbolic trajectory evaluation (STE) and generalized symbolic trajectory evaluation (GSTE) are based on this idea of symbolic simulation.

References

^ Bryant, Randal E. (1990). "Symbolic simulation---techniques and applications". Conference proceedings on 27th ACM/IEEE design automation conference - DAC '90. ACM Press. pp. 517–521. doi:10.1145/123186.128296. ISBN 978-0-89791-363-8.

This computer science article is a stub. You can help Wikipedia by expanding it.

[1] Bryant, Randal E. (1990). "Symbolic simulation---techniques and applications". Conference proceedings on 27th ACM/IEEE design automation conference - DAC '90. ACM Press. pp. 517–521. doi:10.1145/123186.128296. ISBN 978-0-89791-363-8.

[1]

See also

References