Definition and Expansion of Composite Automata in IOA
The IOA language provides notations for defining both primitive and composite I/O automata.This note describes, both formally and with examples, the constraints on these definitions, thecomposability requirements for the components of a composite automaton, and the transformationof a composite autom...
Main Authors: | Tauber, Joshua A., Garland, Stephen J. |
---|---|
Other Authors: | Theory of Computation |
Language: | en_US |
Published: |
2005
|
Online Access: | http://hdl.handle.net/1721.1/30487 |
Similar Items
-
The IOA Simulator
by: Kaynar, Dilsun Kirh, et al.
Published: (2023) -
Implementing Asynchronous Distributed Systems Using the IOA Toolkit
by: Georgiou, Chryssis, et al.
Published: (2005) -
CoqIOA : a formalization of IO automata in the Coq proof assistant
by: Athalye, Anish (Anish R.)
Published: (2017) -
Code generation for the IOA language
by: Tsai, Michael J. (Michael Jordan), 1979-
Published: (2014) -
A simulator for the IOA language
by: Chefter, Anna E., 1973-
Published: (2009)