Skip to main content
Presentation
Decomposing controllers into non-conflicting distributed controllers
Theoretical Aspects of Computing - ICTAC 2004
  • Padmanabhan Krishnan, Bond University
Date of this Version
9-24-2004
Document Type
Conference Paper
Publication Details
Accepted Version.

Krishnan, P. (2005). Decomposing controllers into non-conflicting distributed controllers. Paper presented at Theoretical Aspects of Computing - ICTAC 2004, Guiyang, China.

Access the publisher's website.

2005 HERDC submission. FoR code: 0802

© Copyright Springer-Verlag Berlin Heidelberg, 2005
Disciplines
Abstract

In this article we present an application of decompositions of automata to obtain distributed controllers. The decomposition technique is derived from the classical method of partitions. Tiffs is then applied to the domain of discrete event systems. We show that it is possible to decompose a monolithic controller into smaller controllers which are non-conflicting. This is derived from the notion of decompositions via partitions. Some global state information is necessary to ensure that the joint behaviour of the component automata is identical to the original controller. The global state information required is identical to the global information present in Zielonka asynchronous automata. The joint behaviour of the component automata is shown to be non-conflicting.

Citation Information
Padmanabhan Krishnan. "Decomposing controllers into non-conflicting distributed controllers" Theoretical Aspects of Computing - ICTAC 2004 Vol. 3407 (2004) p. 511 - 526
Available at: http://works.bepress.com/paddy_krishnan/18/