Open AccessJournal Article
An introduction to input/output automata
Nancy Lynch,Mark R. Tuttle +1 more
TLDR
This paper is intended to introduce researchers to the input output automaton model and examines several illustrative examples concerning candy vending machines and other uses of the model.Abstract:
The input output automaton model has recently been de ned in LT LT as a tool for modeling concurrent and distributed discrete event systems of the sorts arising in computer science Since its introduction the model has been used for describing and reasoning about several di erent types of systems including network resource allocation algorithms communication algorithms concurrent database systems shared atomic objects and data ow architectures This paper is intended to introduce researchers to the model It is orga nized as follows Section contains an overview of the model Section de nes the model formally and examines several illustrative examples concerning candy vending machines Section contains a second example a leader election algo rithm Finally Section contains a survey of some of the uses that have so far been made of the modelread more
Citations
More filters
Book
Distributed algorithms
TL;DR: This book familiarizes readers with important problems, algorithms, and impossibility results in the area, and teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
Journal ArticleDOI
Wait-free synchronization
TL;DR: A hierarchy of objects is derived such that no object at one level has a wait-free implementation in terms of objects at lower levels, and it is shown that atomic read/write registers, which have been the focus of much recent attention, are at the bottom of the hierarchy.
Journal ArticleDOI
A formal basis for architectural connection
Robert J. Allen,David Garlan +1 more
TL;DR: The key idea is to define architectural connectors as explicit semantic entities as a collection of protocols that characterize each of the participant roles in an interaction and how these roles interact.
Journal ArticleDOI
The Oracle Problem in Software Testing: A Survey
TL;DR: This paper provides a comprehensive survey of current approaches to the test oracle problem and an analysis of trends in this important area of software testing research and practice.
Journal ArticleDOI
Group communication specifications: a comprehensive study
TL;DR: The specification framework presented in this article will help builders of group communication systems understand andspecify their service semantics; the extensive survey will allow them to compare their service to others, and serve as a unified framework for the classification, analysis, and comparison of group Communication systems.
References
More filters
Journal ArticleDOI
Communicating sequential processes
TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.
Book
A calculus of communicating systems
TL;DR: A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0.
Proceedings Article
The Semantics of a Simple Language for Parallel Programming.
TL;DR: A simple language for parallel programming is described and its mathematical properties are studied to make a case for more formal languages for systems programming and the design of operating systems.
ReportDOI
A Distributed Algorithm for Minimum Weight Spanning Trees. Revision
TL;DR: In this paper, a distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights, where a processor exists at each node of the graph, knowing initially only the weights of the adjacent edges.
Proceedings ArticleDOI
Hierarchical correctness proofs for distributed algorithms
Nancy Lynch,Mark R. Tuttle +1 more
TL;DR: This thesis introduces a new model for distributed computation in asynchronous networks, the input-output automaton, which captures in a novel way the game-theoretical interaction between a system and its environment and allows fundamental properties of distributed computation to be naturally expressed.