A fully abstract semantics for event-based simulation:
Event-based simulation is a popular technique for predicting the behavior of, among other things, digital circuits. On the other hand, applicative denotational formalisms, in which circuits are represented by functional equations with an explicit time variable, are becoming popular for other reasoni...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
1987
|
| Schriftenreihe: | Artificial Intelligence Laboratory <Cambridge, Mass.>: A. I. Memo
966. |
| Schlagworte: | |
| Zusammenfassung: | Event-based simulation is a popular technique for predicting the behavior of, among other things, digital circuits. On the other hand, applicative denotational formalisms, in which circuits are represented by functional equations with an explicit time variable, are becoming popular for other reasoning tasks. Before a system is to be use both approaches to modeling circuits, questions of semantic equivalence must be addressed. In particular, if two circuits are equivalent in one formalism, will they be equivalent in the other? What modeling restrictions are needed to bring this about? This paper shows that, provided circuits 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, an illustrates the application of this semantic relationship to modeling questions. |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV007648603 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 930421s1987 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)227714584 | ||
| 035 | |a (DE-599)BVBBV007648603 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 | ||
| 100 | 1 | |a Hall, Robert J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A fully abstract semantics for event-based simulation |
| 264 | 1 | |a Cambridge, Mass. |c 1987 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Artificial Intelligence Laboratory <Cambridge, Mass.>: A. I. Memo |v 966. | |
| 520 | 3 | |a Event-based simulation is a popular technique for predicting the behavior of, among other things, digital circuits. On the other hand, applicative denotational formalisms, in which circuits are represented by functional equations with an explicit time variable, are becoming popular for other reasoning tasks. Before a system is to be use both approaches to modeling circuits, questions of semantic equivalence must be addressed. In particular, if two circuits are equivalent in one formalism, will they be equivalent in the other? What modeling restrictions are needed to bring this about? This paper shows that, provided circuits 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, an illustrates the application of this semantic relationship to modeling questions. | |
| 650 | 7 | |a Abstracts |2 dtict | |
| 650 | 7 | |a Circuits |2 dtict | |
| 650 | 7 | |a Cybernetics |2 scgdst | |
| 650 | 7 | |a Digital systems |2 dtict | |
| 650 | 7 | |a Equations |2 dtict | |
| 650 | 7 | |a Functional analysis |2 dtict | |
| 650 | 7 | |a Models |2 dtict | |
| 650 | 7 | |a Psychology |2 scgdst | |
| 650 | 7 | |a Reasoning |2 dtict | |
| 650 | 7 | |a Semantics |2 dtict | |
| 650 | 7 | |a Tightness |2 dtict | |
| 830 | 0 | |a Artificial Intelligence Laboratory <Cambridge, Mass.>: A. I. Memo |v 966. |w (DE-604)BV006654788 |9 966 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005011766 | |
Datensatz im Suchindex
| _version_ | 1820882537902243840 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Hall, Robert J. |
| author_facet | Hall, Robert J. |
| author_role | aut |
| author_sort | Hall, Robert J. |
| author_variant | r j h rj rjh |
| building | Verbundindex |
| bvnumber | BV007648603 |
| classification_rvk | SS 4860 |
| ctrlnum | (OCoLC)227714584 (DE-599)BVBBV007648603 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV007648603</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930421s1987 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227714584</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV007648603</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hall, Robert J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A fully abstract semantics for event-based simulation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Artificial Intelligence Laboratory <Cambridge, Mass.>: A. I. Memo</subfield><subfield code="v">966.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Event-based simulation is a popular technique for predicting the behavior of, among other things, digital circuits. On the other hand, applicative denotational formalisms, in which circuits are represented by functional equations with an explicit time variable, are becoming popular for other reasoning tasks. Before a system is to be use both approaches to modeling circuits, questions of semantic equivalence must be addressed. In particular, if two circuits are equivalent in one formalism, will they be equivalent in the other? What modeling restrictions are needed to bring this about? This paper shows that, provided circuits 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, an illustrates the application of this semantic relationship to modeling questions.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Abstracts</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Circuits</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Cybernetics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Digital systems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Equations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Functional analysis</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Models</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Psychology</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Reasoning</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Semantics</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Tightness</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Artificial Intelligence Laboratory <Cambridge, Mass.>: A. I. Memo</subfield><subfield code="v">966.</subfield><subfield code="w">(DE-604)BV006654788</subfield><subfield code="9">966</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005011766</subfield></datafield></record></collection> |
| id | DE-604.BV007648603 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T17:08:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005011766 |
| oclc_num | 227714584 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR |
| owner_facet | DE-355 DE-BY-UBR |
| physical | 16 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| record_format | marc |
| series | Artificial Intelligence Laboratory <Cambridge, Mass.>: A. I. Memo |
| series2 | Artificial Intelligence Laboratory <Cambridge, Mass.>: A. I. Memo |
| spelling | Hall, Robert J. Verfasser aut A fully abstract semantics for event-based simulation Cambridge, Mass. 1987 16 S. txt rdacontent n rdamedia nc rdacarrier Artificial Intelligence Laboratory <Cambridge, Mass.>: A. I. Memo 966. Event-based simulation is a popular technique for predicting the behavior of, among other things, digital circuits. On the other hand, applicative denotational formalisms, in which circuits are represented by functional equations with an explicit time variable, are becoming popular for other reasoning tasks. Before a system is to be use both approaches to modeling circuits, questions of semantic equivalence must be addressed. In particular, if two circuits are equivalent in one formalism, will they be equivalent in the other? What modeling restrictions are needed to bring this about? This paper shows that, provided circuits 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, an illustrates the application of this semantic relationship to modeling questions. Abstracts dtict Circuits dtict Cybernetics scgdst Digital systems dtict Equations dtict Functional analysis dtict Models dtict Psychology scgdst Reasoning dtict Semantics dtict Tightness dtict Artificial Intelligence Laboratory <Cambridge, Mass.>: A. I. Memo 966. (DE-604)BV006654788 966 |
| spellingShingle | Hall, Robert J. A fully abstract semantics for event-based simulation Artificial Intelligence Laboratory <Cambridge, Mass.>: A. I. Memo Abstracts dtict Circuits dtict Cybernetics scgdst Digital systems dtict Equations dtict Functional analysis dtict Models dtict Psychology scgdst Reasoning dtict Semantics dtict Tightness dtict |
| title | A fully abstract semantics for event-based simulation |
| title_auth | A fully abstract semantics for event-based simulation |
| title_exact_search | A fully abstract semantics for event-based simulation |
| title_full | A fully abstract semantics for event-based simulation |
| title_fullStr | A fully abstract semantics for event-based simulation |
| title_full_unstemmed | A fully abstract semantics for event-based simulation |
| title_short | A fully abstract semantics for event-based simulation |
| title_sort | a fully abstract semantics for event based simulation |
| topic | Abstracts dtict Circuits dtict Cybernetics scgdst Digital systems dtict Equations dtict Functional analysis dtict Models dtict Psychology scgdst Reasoning dtict Semantics dtict Tightness dtict |
| topic_facet | Abstracts Circuits Cybernetics Digital systems Equations Functional analysis Models Psychology Reasoning Semantics Tightness |
| volume_link | (DE-604)BV006654788 |
| work_keys_str_mv | AT hallrobertj afullyabstractsemanticsforeventbasedsimulation |