A decidable class of asynchronous distributed controllers

P. Madhusudan, P. S. Thiagarajan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study the problem of synthesizing controllers in a natural distributed asynchronous setting: a finite set of plants interact with their local environments and communicate with each other by synchronizing on common actions. The controller-synthesis problem is to come up with a local strategy for each plant such that the controlled behaviour of the network meets a specification. We consider linear time specifications and provide, in some sense, a minimal set of restrictions under which this problem is effectively solvable: we show that the controller-synthesis problem under these restrictions is decidable while the problem becomes undecidable if any one or more of these three restrictions are dropped.

Original languageEnglish (US)
Title of host publicationCONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings
EditorsLubos Brim, Mojmir Kretinsky, Antonin Kucera, Petr Jancar
PublisherSpringer
Pages145-160
Number of pages16
ISBN (Print)3540440437, 9783540440437
DOIs
StatePublished - Jan 1 2002
Externally publishedYes
Event13th International Conference on Concurrency Theory, CONCUR 2002 - Brno, Czech Republic
Duration: Aug 20 2002Aug 23 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2421 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Conference on Concurrency Theory, CONCUR 2002
Country/TerritoryCzech Republic
CityBrno
Period8/20/028/23/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'A decidable class of asynchronous distributed controllers'. Together they form a unique fingerprint.

Cite this