Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,541,792 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.
2016
2016
Tracking control of deterministic I/O automata
M. Schuh
,
J. Lunze
International Workshop on Discrete Event Systems
2016
Corpus ID: 6024232
A tracking control framework for plants modeled by deterministic I/O automata is presented. The control aim is to steer the plant…
Expand
2011
2011
Knows Best : Systematic Optimizations for Verifiable Distributed Algorithms
Petros Maniatis
2011
Corpus ID: 265039596
Complex distributed algorithms become running systems through an integration with optimizations that target the system’s…
Expand
2009
2009
Inference and Abstraction of Communication Protocols
F. Aarts
2009
Corpus ID: 2956350
In this master thesis we investigate to infer models of standard communication protocols using automata learning techniques. One…
Expand
2007
2007
Formal Speciication of a Dynamically Conngurable Distributed System Formal Speciication of a Dynamically Conngurable Distributed System
Ram Sethuraman
,
K. Goldman
2007
Corpus ID: 16536214
The Programmers' Playground is a programming environment that supports end-user construction of distributed multimedia…
Expand
2007
2007
A Uniied Model for Shared-memory and Message-passing Systems a Uniied Model for Shared-memory and Message-passing Systems
Katherine Yelicky
2007
Corpus ID: 18724377
A uniied model of distributed systems that accommodates both shared-memory and message-passing communication is proposed. An…
Expand
2005
2005
Parallel Web prefetching on cluster server
Cairong Yan
,
Junyi Shen
,
Qinke Peng
Canadian Conference on Electrical and Computer…
2005
Corpus ID: 6513288
Prefetching is an important technique for single Web server to reduce the average Web access latency and applying it on cluster…
Expand
2004
2004
Decomposing Verification of Timed I/O Automata
D. Kaynar
,
N. Lynch
FORMATS/FTRTFT
2004
Corpus ID: 14975681
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling…
Expand
1999
1999
A Client-Server Approach to Virtually Synchronous Group Multicast : Speci cations , Algorithms , and Proofs
I. Keidar
,
R. Khazan
1999
Corpus ID: 16136409
This paper presents a formal design for a novel group multicast service that provides virtually synchronous semantics in…
Expand
1996
1996
A State-Space-Based Approach to Acquisition of I/O Automaton - A Case Study for Design of Hybrid Control Systems
Zhenyu Yang
,
Jian Lu
,
Zongji Chen
1996
Corpus ID: 67019990
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