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.
Supported in part by NSF awards CCR99-70925 and ITR/SY 0121431
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th Int. Coll. on Automata, Languages and Programming, volume 372 of LNCS, pages 1–17. Springer-Verlag, 1989.
J. R. Büchi and L. H. Landweber. Solving sequential conditions by finitestate strategies. Trans. AMS, 138:295–311, 1969.
A. Church. Logic, arithmetics, and automata. In Proc. International Congress of Mathematicians, 1962, pages 23–35. institut Mittag-Leffler, 1963.
V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
J. G. Henriksen and P. S. Thiagarajan. Distributed versions of Linear time temporal logic. In Lectures on Petri Nets: Basic Models, volume 1491 of Lecture Notes in Computer Science, pages 643–682. Springer-Verlag, (1998).
O. Kupferman and M. Y. Vardi. Church’s problem revisited. The Bulletin of Symbolic Logic, 5(2):245–263, June 1999.
O. Kupferman and M. Vardi. μ-calculus synthesis. In MFCS: Symposium on Mathematical Foundations of Computer Science, vol. 1893 of LNCS, 2000.
O. Kupferman and M. Vardi. Synthesizing distributed systems. In 16th Annual IEEE Symp on Logic in Computer Science, pages 16–19, USA, 2001. IEEE Comp. Society.
N. A. Lynch. Distributed Algorithms Morgan Kaufmann Publ. Inc., 1996.
P. Madhusudan. Control and synthesis of open reactive systems. PhD thesis, Institute of Mathematical Sciences, 2001.
P. Madhusudan and P. S. Thiagarajan. Distributed control and synthesis for local specifications. In Proc., ICALP’01, volume 2076 of LNCS, July 2001.
G. L. Peterson and J. H. Reif. Multiple-person alternation. In Proc. 20th IEEE Symposium on Foundation of Computer Science, pages 348–363, 1979.
A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symposium on Principles of Programming Languages, 1989.
A. Pnueli and R. Rosner. On the synthesis of an asynchronous reactive module. In Proc. 16th ICALP, volume 372, pages 652–671. LNCS, 1989.
A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proc. 31st IEEE Symp. on Foundation of Comp. Sc., pages 746–757, 1990.
W. Thomas. Automata on Infinite Objects. In Handbook of Theoretical Comp. Sc., volume B, pages 135–191, Elsevier, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Madhusudan, P., Thiagarajan, P.S. (2002). A Decidable Class of Asynchronous Distributed Controllers. In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-45694-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44043-7
Online ISBN: 978-3-540-45694-0
eBook Packages: Springer Book Archive