The DOI matches its Crossref record.
An Introduction to Input/Output Automata
Open accessAbstract
We describe the input/output automaton model, a model for concurrent and distributed discrete event systems. We define the model, illustrate the model with several examples concerning vending machines and a leader election algorithm, and survey the ways in which the model has been used.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
A formal basis for architectural connection
Allen, R., & Garlan, D. (1997) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/258077.258078 · Cited by 1,253
The oracle problem in software testing: A survey
Barr, E. T., Harman, M., McMinn, P., Shahbaz, M., & Yoo, S. (2015) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2014.2372785 · Cited by 1,104
Group communication specifications: a comprehensive study
Chockler, G. V., Keidar, I., & Vitenberg, R. (2001) · ACM Computing Surveys · doi:10.1145/503112.503113 · Cited by 630
Manadhata, P. K., & Wing, J. M. (2011) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2010.60 · Cited by 625
Total order broadcast and multicast algorithms: Taxonomy and survey
Défago, X., Schiper, A., & Urbán, P. (2004) · ACM Computing Surveys · doi:10.1145/1041680.1041682 · Cited by 543
Secure and Efficient Asynchronous Broadcast Protocols
Cachin, C., Kursawe, K., Petzold, F., & Shoup, V. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_31 · Cited by 371
Hybrid I/O automata: Extended abstract
Lynch, N., Segala, R., Vaandrager, F., & Weinberg, H. B. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0020971 · Cited by 269
Self-citation
Metadata
- Authors
- Lynch, N. A., & Tuttle, M. R.
- Venue
- Formal Aspects of Computing
- Published
- 2026-01-27
- Volume
- 38
- Issue
- 3
- Pages
- 1-22
- ISSN
- 0934-5043 (ISSN-L)
- 1433-299X
- OpenAlex
- W1498342204
- Cited by
- 1,011
- References
- 0
- FWCI
- 3.56
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.