Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge

We study the problem of controller synthesis for distributed systems modelled by Zielonka automata. While the decidability of this problem in full generality remains open and challenging, we suggest here to seek controllers from a parametrised family: we are interested in controllers that ensure frequent communication between the processes, where frequency is determined by the parameter. We show that this restricted controller synthesis version is affordable for synthesis standards: fixing the parameter, the problem is Exptime-complete.

[1]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[2]  O. Kupermann,et al.  Synthesizing distributed systems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

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

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

[5]  Kousha Etessami,et al.  Verifying Probabilistic Procedural Programs , 2004, FSTTCS.

[6]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[7]  Sundar Sarukkai,et al.  FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings , 2005, FSTTCS.

[8]  Orna Kupferman,et al.  Safraless decision procedures , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[9]  Bernd Finkbeiner,et al.  Synthesis of Asynchronous Systems , 2006, LOPSTR.

[10]  P. Madhusudan,et al.  Synthesizing Reactive Programs , 2011, CSL.

[11]  Jean-François Raskin,et al.  An Antichain Algorithm for LTL Realizability , 2009, CAV.

[12]  Anca Muscholl,et al.  Asynchronous Games over Tree Architectures , 2012, ICALP.

[13]  P. S. Thiagarajan,et al.  Distributed Controller Synthesis for Local Specifications , 2001, ICALP.

[14]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[15]  Sven Schewe.  Solving Parity Games in Big Steps , 2007, FSTTCS.

[16]  Mihalis Yannakakis,et al.  Temporal Synthesis for Bounded Systems and Environments , 2011, STACS.

[17]  Doron A. Peled,et al.  Model Checking-Based Genetic Programming with an Application to Mutual Exclusion , 2008, TACAS.

[18]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[19]  Mohamed Faouzi Atig,et al.  Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads , 2009, TACAS.

[20]  P. S. Thiagarajan,et al.  A Decidable Class of Asynchronous Distributed Controllers , 2002, CONCUR.

[21]  P. S. Thiagarajan,et al.  The MSO Theory of Connectedly Communicating Processes , 2005, FSTTCS.

[22]  Volker Diekert,et al.  The Book of Traces , 1995 .

[23]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.

[24]  Manuel V. Hermenegildo,et al.  Energy Consumption Analysis of Programs Based on XMOS ISA-Level Models , 2013, LOPSTR.

[25]  Bernd Finkbeiner,et al.  Bounded synthesis , 2012, International Journal on Software Tools for Technology Transfer.

[26]  Anca Muscholl,et al.  Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata , 2010, ICALP.

[27]  Paul Gastin,et al.  Fair Synthesis for Asynchronous Distributed Systems , 2013, TOCL.

[28]  David E. Muller,et al.  Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra , 1995, Theor. Comput. Sci..

[29]  Sven Schewe,et al.  Synthesis of succinct systems , 2012, J. Comput. Syst. Sci..

[30]  Ofer Strichman,et al.  Bounded model checking , 2003, Adv. Comput..

[31]  Paul Gastin,et al.  Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems , 2004, FSTTCS.

[32]  Jakob Rehof,et al.  Context-Bounded Model Checking of Concurrent Software , 2005, TACAS.

[33]  Rüdiger Ehlers.  Symbolic Bounded Synthesis , 2010, CAV.

[34]  Bernd Finkbeiner,et al.  Uniform distributed synthesis , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[35]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[36]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[37]  Nathalie Bertrand,et al.  Bounded Satisfiability for PCTL , 2012, CSL.

[38]  Sanjiva Prasad,et al.  FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings , 2007, FSTTCS.