On Automata with Boundary
| dc.creator | Gates, R. | |
| dc.creator | Katis, P. | |
| dc.creator | Sabadini, N. | |
| dc.creator | Walters, R. F. C. | |
| dc.date | 2000-02-16 | |
| dc.date.accessioned | 2026-07-25T23:55:06Z | |
| dc.description | 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. | |
| dc.description | 41 pages, 22 figures. Uses Paul Taylor's diagrams macros, see http://www.ctan.org/tex-archive/macros/generic/diagrams/taylor/ | |
| dc.identifier | https://arxiv.org/abs/cs/0002008 | |
| dc.identifier | http://arxiv.org/abs/cs/0002008 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/102465 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | D.2.2; D.2.4; F.1.1 | |
| dc.title | On Automata with Boundary | |
| dc.type | text |