Open Systems in Reactive Environments: Control and Synthesis

We study the problems of synthesizing open systems as well as controllers for them. The key aspect of our model is that it caters to reactive environments, which can disable different sets of responses when reacting with the system. We deal with specifications given as formulas in CTL* and its sub-logic CTL. We show that both these problems, with specifications in CTL (CTL*), are 2EXPTIME-complete (resp. 3EXPTIME-complete). Thus, in a sense, reactive environments constitute a provably harder setting for the synthesis of open systems and controllers for them.

[1]  P. S. Thiagarajan,et al.  Controllers for Discrete Event Systems via Morphisms , 1998, CONCUR.

[2]  Pierre Wolper,et al.  The Complementation Problem for Büchi Automata with Appplications to Temporal Logic , 1987, Theor. Comput. Sci..

[3]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Fair Realizability and Synthesis , 1995, CAV.

[4]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[5]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[6]  Marco Antoniotti,et al.  Synthesis and verification of discrete controllers for robotics and manufacturing devices with temporal logic and the control-D system , 1996 .

[7]  Paolo Traverso,et al.  Strong Cyclic Planning Revisited , 1999, ECP.

[8]  Vijay K. Garg,et al.  Modeling and Control of Logical Discrete Event Systems , 1994 .

[9]  Amir Pnueli,et al.  On the Development of Reactive Systems , 1989, Logics and Models of Concurrent Systems.

[10]  M. Rabin.  Automata on Infinite Objects and Church's Problem , 1972 .

[11]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[12]  Orna Kupferman,et al.  Robust Satisfaction , 1999, CONCUR.

[13]  Larry J. Stockmeyer,et al.  Improved upper and lower bounds for modal logics of programs , 1985, STOC '85.

[14]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[15]  M. Shayman,et al.  Centralized and Decentralized Supervisory Control of Nondeterministic Systems Under Partial Observation , 1997 .

[16]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[17]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[18]  Orna Kupferman,et al.  µ-Calculus Synthesis , 2000, MFCS.

[19]  Leslie Lamport,et al.  "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.

[20]  Mark A. Shayman,et al.  Supervisory Control of Nondeterministic Systems with Driven Events via Prioritized Synchronization and Trajectory Models , 1995 .

[21]  Orna Kupferman,et al.  Module Checking Revisited , 1997, CAV.

[22]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[23]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[24]  Orna Kupferman,et al.  Module Checking , 1996, Inf. Comput..

[25]  Orna Kupferman,et al.  Church's Problem Revisited , 1999, Bulletin of Symbolic Logic.