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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lavignon, Jean-François (VerfasserIn), Shoham, Yoav (VerfasserIn)
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.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!