Abstract
The term Input/Output Automata refers to a family of system modeling frameworks based on interacting infinite-state machines. The models come in several flavors, based on which features (fairness, time, continuous behavior, probability, etc.) they can express. In each of these frameworks, automata can be composed in parallel to form more complex automata, and automata can be related using levels of abstraction. Properties of automata can be proved by hand or with the assistance of theorem-proving programs.
Cite
CITATION STYLE
Lynch, N. (2003). Input/output automata: Basic, timed, hybrid, probabilistic, dynamic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2761). Springer Verlag. https://doi.org/10.1007/978-3-540-45187-7_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
