Parameterized Synthesis

We study the synthesis problem for distributed architectures with a parametric number of finite-state components. Parameterized specifications arise naturally in a synthesis setting, but thus far it was unclear how to detect realizability and how to perform synthesis in a parameterized setting. Using a classical result from verification, we show that for a class of specifications in indexed LTL\X, parameterized synthesis in token ring networks is equivalent to distributed synthesis in a network consisting of a few copies of a single process. Adapting a well-known result from distributed synthesis, we show that the latter problem is undecidable. We describe a semi-decision procedure for the parameterized synthesis problem in token rings, based on bounded synthesis. We extend the approach to parameterized synthesis in token-passing networks with arbitrary topologies, and show applicability on a simple case study. Finally, we sketch a general framework for parameterized synthesis based on cutoffs and other parameterized verification techniques.

[1]  Kedar S. Namjoshi,et al.  Reasoning about rings , 1995, POPL '95.

[2]  Robert P. Kurshan,et al.  A structural induction theorem for processes , 1989, PODC.

[3]  Helmut Veith,et al.  Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems , 2008, TACAS.

[4]  Amir Pnueli,et al.  Liveness with (0, 1, ∞)-counter abstraction , 2002 .

[5]  Amir Pnueli,et al.  Specify, Compile, Run: Hardware from PSL , 2007, COCV@ETAPS.

[6]  Ichiro Suzuki,et al.  Proving Properties of a Ring of Finite-State Machines , 1988, Inf. Process. Lett..

[7]  Benjamin Aminof,et al.  Parameterized Model Checking of Token-Passing Systems , 2013, VMCAI.

[8]  Sven Schewe,et al.  Distributed synthesis is simply undecidable , 2014, Inf. Process. Lett..

[9]  Roderick Bloem,et al.  Parameterized Synthesis , 2012, TACAS.

[10]  Vineet Kahlon,et al.  Exact and Efficient Verification of Parameterized Cache Coherence Protocols , 2003, CHARME.

[11]  Amir Pnueli,et al.  Automatic Hardware Synthesis from Specifications: A Case Study , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[12]  Daniel Kroening,et al.  Dynamic Cutoff Detection in Parameterized Concurrent Programs , 2010, CAV.

[13]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[14]  Bernd Finkbeiner,et al.  Lazy Synthesis , 2012, VMCAI.

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

[16]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[17]  Vineet Kahlon,et al.  Reducing Model Checking of the Many to the Few , 2000, CADE.

[18]  Amir Pnueli,et al.  Synthesis of Reactive(1) designs , 2006, J. Comput. Syst. Sci..

[19]  Somesh Jha,et al.  Verifying parameterized networks , 1997, TOPL.

[20]  Ahmed Bouajjani,et al.  Verification of parametric concurrent systems with prioritised FIFO resource management , 2008, Formal Methods Syst. Des..

[21]  Vineet Kahlon,et al.  Reasoning About Threads Communicating via Locks , 2005, CAV.

[22]  Helmut Veith,et al.  Verification by Network Decomposition , 2004, CONCUR.

[23]  Roderick Bloem,et al.  PARTY Parameterized Synthesis of Token Rings , 2013, CAV.

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

[25]  Helmut Veith,et al.  Environment Abstraction for Parameterized Verification , 2006, VMCAI.

[26]  Vineet Kahlon,et al.  Parameterized Model Checking of Ring-Based Message Passing Systems , 2004, CSL.

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

[28]  Doron A. Peled,et al.  Synthesizing Solutions to the Leader Election Problem Using Model Checking and Genetic Programming , 2009, Haifa Verification Conference.

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

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

[31]  Amir Pnueli,et al.  Model checking and abstraction to the aid of parameterized systems (a survey) , 2004, Comput. Lang. Syst. Struct..

[32]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[33]  Amir Pnueli,et al.  Automatic Deductive Verification with Invisible Invariants , 2001, TACAS.

[34]  Véronique Bruyère,et al.  Acacia+, a Tool for LTL Synthesis , 2012, CAV.

[35]  Samik Basu,et al.  Behavioral automata composition for automatic topology independent verification of parameterized systems , 2009, ESEC/FSE '09.

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

[37]  E. Allen Emerson,et al.  A decidable temporal logic to reason about many processes , 1990, PODC '90.

[38]  Roderick Bloem,et al.  Towards Efficient Parameterized Synthesis , 2013, VMCAI.

[39]  P. Dangerfield.  Logic , 1996, Aristotle and the Stoics.

[40]  Alonzo Church,et al.  Logic, arithmetic, and automata , 1962 .

[41]  Marcus Nilsson,et al.  Regular Model Checking , 2000, CAV.