Content deleted Content added
m Date the maintenance tags or general fixes |
Citation bot (talk | contribs) Alter: title, template type. Add: chapter-url, chapter. Removed or converted URL. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 522/748 |
||
| (19 intermediate revisions by 14 users not shown) | |||
Line 1:
{{short description|Form of simulation where many possible executions of a system are considered simultaneously}}{{Refimprove|date=April 2024}}
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.▼
▲In computer science, a [[simulation]] is a computation of the execution of some appropriately modelled [[state transition system|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. For each possible valuation of these variables, there is a concrete system state that is being indirectly simulated.▼
▲'''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 (programming)|variable]] can be used in the simulation state representation in order to index multiple executions of the system.<ref>{{Cite book |last=Bryant |first=Randal E. |chapter=Symbolic simulation---techniques and applications |date=1990 |title=Conference proceedings on 27th ACM/IEEE design automation conference - DAC '90 |chapter-url=http://portal.acm.org/citation.cfm?doid=123186.128296 |language=en |publisher=ACM Press |pages=517–521 |doi=10.1145/123186.128296 |isbn=978-0-89791-363-8}}</ref> 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.▼
▲Because symbolic simulation can cover many system executions in a single simulation, it can greatly reduce the size of verification problems. Techniques such as [[
== See also ==
* [[Symbolic execution]]
* [[Symbolic computation]]
==References==
{{reflist}}
{{DEFAULTSORT:Symbolic Simulation}}
[[Category:Electronic design automation]]
[[Category:Formal methods]]
{{compsci-stub}}
| |||