Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2000-02-16
Computer Science
Distributed, Parallel, and Cluster Computing
41 pages, 22 figures. Uses Paul Taylor's diagrams macros, see http://www.ctan.org/tex-archive/macros/generic/diagrams/taylor/
Scientific paper
We present a theory of automata with boundary for designing, modelling and analysing distributed systems. Notions of behaviour, design and simulation appropriate to the theory are defined. The problem of model checking for deadlock detection is discussed, and an algorithm for state space reduction in exhaustive search, based on the theory presented here, is described. Three examples of the application of the theory are given, one in the course of the development of the ideas and two as illustrative examples of the use of the theory.
Gates Ruggles R.
Katis Piergiulio
Sabadini N.
Walters R. F. C.
No associations
LandOfFree
On Automata with Boundary does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Automata with Boundary, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Automata with Boundary will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-239212