A Fully Abstract Semantics for Event-Based Simulation
dc.date.accessioned | 2004-10-01T20:10:26Z | |
dc.date.accessioned | 2018-11-24T10:09:40Z | |
dc.date.available | 2004-10-01T20:10:26Z | |
dc.date.available | 2018-11-24T10:09:40Z | |
dc.date.issued | 1987-05-01 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/5592 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/5592 | |
dc.description.abstract | This paper shows that, provided circuits contain no zero-delay loops, a tight relationship, full abstraction, exists between a natural event-based operational semantics for circuits and a natural denotational semantics for circuits based on causal functions on value timelines. The paper also discusses what goes wrong if zero-delay loops are allowed, and illustrates the application of this semantic relationship to modeling questions. | en_US |
dc.format.extent | 17 p. | en_US |
dc.format.extent | 2325461 bytes | |
dc.format.extent | 912315 bytes | |
dc.language.iso | en_US | |
dc.subject | event-based simulation | en_US |
dc.subject | full abstraction | en_US |
dc.subject | denotationalssemantics | en_US |
dc.title | A Fully Abstract Semantics for Event-Based Simulation | en_US |
Files in this item
Files | Size | Format | View |
---|---|---|---|
AIM-966.pdf | 912.3Kb | application/pdf | View/ |
AIM-966.ps | 2.325Mb | application/postscript | View/ |