Synthesis of Distributed Systems from Knowledge-Based Specifications

We consider the problem of synthesizing protocols in a distributed setting satisfying specifications phrased in the logic of linear time and knowledge. On the one hand, we show that synthesis is already undecidable in environments with just two agents, one of which observes every aspect of the system state and one of which observes nothing of it. This falsifies a conjecture of van der Meyden and Vardi from CONCUR'96. On the other hand, we prove that synthesis is decidable in broadcast environments, verifying a conjecture of van der Meyden and Vardi from the same paper, and we show that for specifications that are positive in the knowledge modalities the synthesis problem can be reduced to the same problem for formulas without knowledge modalities. After adapting Pnueli and Rosner's decidability result on synthesis for linear temporal logic specifications in hierarchical environments, we obtain that, in our setting, synthesis is decidable for specifications positive in the knowledge modalities when restricted to hierarchical environments. We conclude the decidability in hierarchical systems of a property closely related to nondeducibility on strategies, a notion that has been studied in computer security.

[1]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

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

[4]  Ron van der Meyden,et al.  Finite State Implementations of Knowledge-Based Programs , 1996, FSTTCS.

[5]  Paul C. Attie,et al.  Synthesis of concurrent programs for an atomic read/write model of computation , 2001, TOPL.

[6]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[7]  Orna Kupfermant,et al.  Synthesis with Incomplete Informatio , 2000 .

[8]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[9]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[10]  Kaile Su,et al.  Modal Logics with a Linear Hierarchy of Local Propositional Quantifiers , 2002, Advances in Modal Logic.

[11]  Anish Arora,et al.  Synthesis of fault-tolerant concurrent programs , 2004 .

[12]  David L. Dill,et al.  Synthesizing Processes and Schedulers from Temporal Specifications , 1990, International Conference on Computer Aided Verification.

[13]  Moshe Y. Vardi,et al.  L O ] 2 4 Ju l 2 01 3 Synthesis from Knowledge-Based Specifications ⋆ , 2014 .

[14]  Paul C. Attie,et al.  Synthesis of concurrent systems with many similar processes , 1998, TOPL.

[15]  Kaile Su,et al.  Symbolic model checking the knowledge of the dining cryptographers , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..

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

[17]  Igor Walukiewicz,et al.  Games for synthesis of controllers with partial observation , 2003, Theor. Comput. Sci..

[18]  P. Madhusudan,et al.  Control and synthesis of open reactive systems , 2001 .

[19]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[20]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

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

[22]  Richard Mayr.  Undecidable problems in unreliable computations , 2003, Theor. Comput. Sci..

[23]  I. Walukiewicz.  A landscape with games in the background , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[24]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[25]  Amir Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[26]  Joseph Y. Halpern,et al.  Anonymity and information hiding in multiagent systems , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..

[27]  E. A Emerson,et al.  Using Branching Time Logic to Synthesize Synchronization Skeletons , 1982 .

[28]  J. Todd Wittbold,et al.  Information flow in nondeterministic systems , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[29]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, Logic of Programs.

[30]  Amir Pnueli,et al.  Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[31]  Moshe Y. Vardi,et al.  Synthesis from knowledge-based specifications , 1998 .