Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,378,393 papers from all fields of science
Search
Sign In
Create Free Account
Input/output automaton
Known as:
I/O Automaton
Input/output automata provide a formal model, applicable in describing most types of asynchronous concurrent system. On its own, the I/O automaton…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Actor model
Asynchronous system
Automata theory
Black box
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Towards formally specifying and verifying transactional memory
Simon Doherty
,
L. Groves
,
Victor Luchangco
,
Mark Moir
Formal Aspects of Computing
2009
Corpus ID: 11245345
Over the last decade, great progress has been made in developing practical transactional memory (TM) implementations, but…
Expand
2007
2007
Testing Input/Output Partial Order Automata
S. Haar
,
C. Jard
,
Guy-Vincent Jourdan
TestCom/FATES
2007
Corpus ID: 4812548
We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata…
Expand
2006
2006
Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study
S. Umeno
,
N. Lynch
World Congress on Formal Methods
2006
Corpus ID: 14351560
This paper presents an assertional-style verification of the aircraft landing protocol of NASA's SATS (Small Aircraft…
Expand
2004
2004
A theoretical diagnosis approach applied to a power transmission system
G. Fourlas
,
K. Kyriakopoulos
,
N. J. Krikelis
IEEE Conference on Decision and Control
2004
Corpus ID: 36142498
Fault detection and isolation is a challenging task in the control of large scale complex systems. In this work we proceed to the…
Expand
Highly Cited
2001
Highly Cited
2001
Hybrid I/O Automata Revisited
N. Lynch
,
R. Segala
,
F. Vaandrager
International Conference on Hybrid Systems…
2001
Corpus ID: 8950939
In earlier work, we developed a mathematical hybrid I/O automaton (HIOA) modeling framework, capable of describing both discrete…
Expand
Highly Cited
2001
Highly Cited
2001
Dynamic input/output automata, a formal model for dynamic systems
P. Attie
,
N. Lynch
ACM SIGACT-SIGOPS Symposium on Principles of…
2001
Corpus ID: 7926236
We present a mathematical state-machine model, the Dynamic I/O Automaton (DIOA) model, for defining and analyzing dynamic systems…
Expand
1995
1995
Implementing sequentially consistent shared objects using broadcast and point-to-point communication
A. Fekete
,
M. Kaashoek
,
N. Lynch
Proceedings of 15th International Conference on…
1995
Corpus ID: 1358457
A distributed algorithm that implements a sequentially consistent collection of shared read/update objects using a combination of…
Expand
Highly Cited
1994
Highly Cited
1994
Composition and Behaviors of Probabilistic I/O Automata
S. Wu
,
S. Smolka
,
E. W. Stark
Theoretical Computer Science
1994
Corpus ID: 2540347
1990
1990
Completeness Theorems for Automata
Michael Merritt
REX Workshop
1990
Corpus ID: 5592715
These notes present completeness results for varieties of products, state mappings and auxiliary variable constructions, for a…
Expand
1989
1989
Concurrency control of nested transactions accessing B-trees
A. Fu
,
T. Kameda
ACM SIGACT-SIGMOD-SIGART Symposium on Principles…
1989
Corpus ID: 16889720
This paper presents a concurrency control algorithm for nested transactions accessing B-trees. It combines the idea of B-link…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE