Abstract
In program synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system is open, then at each moment it reads input signals and writes output signals, which depend on the input signals and the history of the computation so far. The specification considers all possible input sequences. Thus, if the specification is linear, it should hold in every computation generated by the interaction, and if the specification is branching, it should hold in the tree that embodies all possible input sequences.
Often, the system cannot read all the input signals generated by its environment. For example, in a distributed setting, it might be that each process can read input signals of only part of the underlying processes. Then, we should transform a specification into a system whose output depends only on the readable parts of the input signals and the history of the computation. This is called synthesis with incomplete information. In this work we solve the problem of synthesis with incomplete information in its full generality. We consider linear and branching settings with complete and incomplete information. We claim that alternation is a suitable and helpful mechanism for coping with incomplete information. Using alternating tree automata, we show that incomplete information does not make the synthesis problem more complex, in both the linear and the branching paradigm. In particular, we prove that independently of the presence of incomplete information, the synthesis problems for CTL and CTL* are complete for EXPTIME and 2EXPTIME, respectively.
Part of this work was done in Bell Laboratories during the DIMACS Special Year on Logic and Algorithms.
Supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR contract F4962093-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA grant NAG2-892, and by the SRC contract 95-DC-324.036.
Supported in part by the National Science Foundation grants CCR-9628400 and CCR-9700061, and by a grant from the Intel Corporation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M., L. Lamport, and P. Wolper: 1989, ‘Realizable and Unrealizable Concurrent Program Specifications’. In: Proc. 16th Int. Colloquium on Automata, Languages and Programming, Vol. 372. pp. 1–17.
Antoniotti, M.: 1995, ‘Synthesis and verification of discrete controllers for robotics and manufacturing devices with temporal logic and the Control-D system’. Ph.D. thesis, New York University, New York.
Bernholtz, O., M. Vardi, and P. Wolper: 1994, ‘An Automata-Theoretic Approach to Branching-Time Model Checking’. In: D. L. Dill (ed.): Computer Aided Verification, Proc. 6th Int. Conference, Vol. 818 of Lecture Notes in Computer Science. Stanford, pp. 142–155.
Büchi, J. and L. Landweber: 1969, ‘Solving sequential conditions by finite-state strategies’. Trans. AMS 138 295–311.
Church, A.: 1963, ‘Logic, arithmetics, and automata’. In: Proc. International Congress of Mathematicians, 1962. pp. 23–35.
Dill, D.: 1989, Trace theory for automatic hierarchical verification of speed independent circuits. MIT Press.
Emerson, A. and A. Sistla: 1984, ‘Deciding full Branching Time Logics’. Information and Control 61(3), 175–201.
Emerson, E.: 1990, ‘Temporal and modal logic’. Handbook of theoretical computer science pp. 997–1072.
Emerson, E. and E. Clarke: 1982, ‘Using Branching Time Logic to Synthesize Synchronization Skeletons’. Science of Computer Programming 2 241–266.
Emerson, E. and J. Halpern: 1986, ‘Sometimes and Not Never Revisited: On Branching Versus Linear Time’. Journal of the ACM 33(1) 151–178.
Emerson, E. and C. Jutla: 1988, ‘The Complexity of Tree Automata and Logics of Programs’. In: Proceedings of the 29th IEEE Symposium on Foundations of Computer Science. White Plains, pp. 368–377.
Fischer, M. and R. Ladner: 1979, ‘Propositional dynamic logic of regular programs’. J. of Computer and Systems Sciences 18 194–211.
Kumar, R. and V. Garg: 1995, Modeling and control of logical discrete event systems. Kluwer Academic Publishers.
Kumar, R. and M. Shayman: 1995, ‘Supervisory control of nondeterministic systems under partial observation and decentralization’. SIAM Journal of Control and Optimization.
Lamport, L.: 1980, ‘Sometimes is sometimes “Not never” — on the temporal logic of programs’. In: Proceedings of the 7th ACM Symposium on Principles of Programming Languages. pp. 174–185.
Manna, Z. and R. Waldinger: 1980, ‘A deductive approach to program synthesis’. ACM Transactions on Programming Languages and Systems 2(1), 90–121.
Muller, D. and P. Schupp: 1987, ‘Alternating automata on infinite trees’. Theoretical Computer Science 54,, 267–276.
Muller, D. and P. Schupp: 1995, ‘Simulating Aternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra’. Theoretical Computer Science 141, 69–107.
Pnueli, A.: 1981, ‘The Temporal Semantics of Concurrent Programs’. Theoretical Computer Science 13, 45–60.
Pnueli, A. and R. Rosner: 1989, ‘On the Synthesis of a Reactive Module’. In: Proceedings of the Sixteenth ACM Symposium on Principles of Programming Languages. Austin.
Pnueli, A. and R. Rosner: 1990, ‘Distributed Reactive Systems are hard to Synthesize’. In: Proc. 31st IEEE Symposium on Foundation of Computer Science. pp. 746–757.
Rabin, M.: 1970, ‘Weakly definable relations and special automata’. In: Proc. Symp. Math. Logic and Foundations of Set Theory. pp. 1–23.
Rosner, R.: 1992, ‘Modular Synthesis of Reactive Systems’. Ph.D. thesis, Weizmann Institute of Science, Rehovot, Israel.
Vardi, M.: 1995, ‘An automata-theoretic approach to fair realizability and synthesis’. In: P. Wolper (ed.): Computer Aided Verification, Proc. 7th Int’l Conf., Vol. 939 of Lecture Notes in Computer Science. pp. 267–292.
Vardi, M. and L. Stockmeyer: 1985, ‘Improved upper and lower bounds for modal logics of programs’. In: Proc 17th ACM Symp. on Theory of Computing. pp. 240–251.
Vardi, M. and P. Wolper: 1986, ‘Automata-Theoretic Techniques for Modal Logics of Programs’. Journal of Computer and System Science 32(2), 182–221.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kupfermant, O., Vardit, M.Y. (2000). Synthesis with Incomplete Informatio. In: Barringer, H., Fisher, M., Gabbay, D., Gough, G. (eds) Advances in Temporal Logic. Applied Logic Series, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9586-5_6
Download citation
DOI: https://doi.org/10.1007/978-94-015-9586-5_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5389-3
Online ISBN: 978-94-015-9586-5
eBook Packages: Springer Book Archive