Temporal automata:
Abstract: "We present a new model of machines and their operation, called temporal automata. Characteristics of this model include explicit representation of process time, symmetric representation of a machine and of the enviroment [sic] in which it operates, the wiring together of asynchronous...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Stanford, Calif.
1990
|
Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1325 |
Schlagworte: | |
Zusammenfassung: | Abstract: "We present a new model of machines and their operation, called temporal automata. Characteristics of this model include explicit representation of process time, symmetric representation of a machine and of the enviroment [sic] in which it operates, the wiring together of asynchronous automata, and the ability to aggregate individual machines to form one machine at a coarser level of granularity. We present the mathematical theory of temporal automata, and provide examples of applying the model. We then relate temporal automata to traditional constructs such as finite automata and Turing machines, as well as to more recent formalisms such as statecharts and situated automata Finally, we briefly describe a formal language for defining temporal automata, a compiler for that language, and a simulator for the output of that compiler. |
Beschreibung: | 41 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008973909 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940206s1990 |||| 00||| eng d | ||
035 | |a (OCoLC)41754675 | ||
035 | |a (DE-599)BVBBV008973909 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
050 | 0 | |a QA267.5.T45 | |
100 | 1 | |a Lavignon, Jean-François |e Verfasser |4 aut | |
245 | 1 | 0 | |a Temporal automata |c by Jean-François Lavignon and Yoav Shoham |
264 | 1 | |a Stanford, Calif. |c 1990 | |
300 | |a 41 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1325 | |
520 | 3 | |a Abstract: "We present a new model of machines and their operation, called temporal automata. Characteristics of this model include explicit representation of process time, symmetric representation of a machine and of the enviroment [sic] in which it operates, the wiring together of asynchronous automata, and the ability to aggregate individual machines to form one machine at a coarser level of granularity. We present the mathematical theory of temporal automata, and provide examples of applying the model. We then relate temporal automata to traditional constructs such as finite automata and Turing machines, as well as to more recent formalisms such as statecharts and situated automata | |
520 | 3 | |a Finally, we briefly describe a formal language for defining temporal automata, a compiler for that language, and a simulator for the output of that compiler. | |
650 | 4 | |a Temporal automata | |
700 | 1 | |a Shoham, Yoav |e Verfasser |4 aut | |
810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1325 |w (DE-604)BV008928280 |9 1325 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005925560 |
Datensatz im Suchindex
_version_ | 1804123311876079616 |
---|---|
any_adam_object | |
author | Lavignon, Jean-François Shoham, Yoav |
author_facet | Lavignon, Jean-François Shoham, Yoav |
author_role | aut aut |
author_sort | Lavignon, Jean-François |
author_variant | j f l jfl y s ys |
building | Verbundindex |
bvnumber | BV008973909 |
callnumber-first | Q - Science |
callnumber-label | QA267 |
callnumber-raw | QA267.5.T45 |
callnumber-search | QA267.5.T45 |
callnumber-sort | QA 3267.5 T45 |
callnumber-subject | QA - Mathematics |
ctrlnum | (OCoLC)41754675 (DE-599)BVBBV008973909 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01848nam a2200325 cb4500</leader><controlfield tag="001">BV008973909</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)41754675</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008973909</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-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.5.T45</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lavignon, Jean-François</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Temporal automata</subfield><subfield code="c">by Jean-François Lavignon and Yoav Shoham</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">41 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">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1325</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a new model of machines and their operation, called temporal automata. Characteristics of this model include explicit representation of process time, symmetric representation of a machine and of the enviroment [sic] in which it operates, the wiring together of asynchronous automata, and the ability to aggregate individual machines to form one machine at a coarser level of granularity. We present the mathematical theory of temporal automata, and provide examples of applying the model. We then relate temporal automata to traditional constructs such as finite automata and Turing machines, as well as to more recent formalisms such as statecharts and situated automata</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Finally, we briefly describe a formal language for defining temporal automata, a compiler for that language, and a simulator for the output of that compiler.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Temporal automata</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shoham, Yoav</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1325</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1325</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005925560</subfield></datafield></record></collection> |
id | DE-604.BV008973909 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:27:46Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005925560 |
oclc_num | 41754675 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 41 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series2 | Stanford University / Computer Science Department: Report STAN CS |
spelling | Lavignon, Jean-François Verfasser aut Temporal automata by Jean-François Lavignon and Yoav Shoham Stanford, Calif. 1990 41 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1325 Abstract: "We present a new model of machines and their operation, called temporal automata. Characteristics of this model include explicit representation of process time, symmetric representation of a machine and of the enviroment [sic] in which it operates, the wiring together of asynchronous automata, and the ability to aggregate individual machines to form one machine at a coarser level of granularity. We present the mathematical theory of temporal automata, and provide examples of applying the model. We then relate temporal automata to traditional constructs such as finite automata and Turing machines, as well as to more recent formalisms such as statecharts and situated automata Finally, we briefly describe a formal language for defining temporal automata, a compiler for that language, and a simulator for the output of that compiler. Temporal automata Shoham, Yoav Verfasser aut Computer Science Department: Report STAN CS Stanford University 1325 (DE-604)BV008928280 1325 |
spellingShingle | Lavignon, Jean-François Shoham, Yoav Temporal automata Temporal automata |
title | Temporal automata |
title_auth | Temporal automata |
title_exact_search | Temporal automata |
title_full | Temporal automata by Jean-François Lavignon and Yoav Shoham |
title_fullStr | Temporal automata by Jean-François Lavignon and Yoav Shoham |
title_full_unstemmed | Temporal automata by Jean-François Lavignon and Yoav Shoham |
title_short | Temporal automata |
title_sort | temporal automata |
topic | Temporal automata |
topic_facet | Temporal automata |
volume_link | (DE-604)BV008928280 |
work_keys_str_mv | AT lavignonjeanfrancois temporalautomata AT shohamyoav temporalautomata |