PARTY Parameterized Synthesis of Token Rings

Synthesis is the process of automatically constructing an implementation from a specification. In parameterized synthesis, we construct a single process such that the distributed system consisting of an arbitratry number of copies of the process satisfies a parameterized specification. In this paper, we present Party, a tool for parameterized synthesis from specifications in indexed linear temporal logic. Our approach extends SMT-based bounded synthesis, a flexible method for distributed synthesis, to parameterized specifications. In the current version, Party can be used to solve the parameterized synthesis problem for token-ring architectures. The tool can also synthesize monolithic systems, for which we provide a comparison to other state-of-the-art synthesis tools.

[1]  Rüdiger Ehlers,et al.  Experimental Aspects of Synthesis , 2011, iWIGP.

[2]  Vojtech Rehák,et al.  LTL to Büchi Automata Translation: Fast and More Deterministic , 2012, TACAS.

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

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

[5]  Marco Pistore,et al.  Nusmv version 2: an opensource tool for symbolic model checking , 2002, CAV 2002.

[6]  Barbara König,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2012, Lecture Notes in Computer Science.

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

[8]  Rüdiger Ehlers,et al.  Unbeast: Symbolic Bounded Synthesis , 2011, TACAS.

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

[10]  David A. McAllester,et al.  Automated Deduction - CADE-17 , 2000, Lecture Notes in Computer Science.

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

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

[13]  E. A. Emerson,et al.  On Reasoning About Rings , 2003, Int. J. Found. Comput. Sci..

[14]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

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

[16]  Roderick Bloem,et al.  Optimizations for LTL Synthesis , 2006, 2006 Formal Methods in Computer Aided Design.

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

[18]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

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

[20]  Rüdiger Ehlers,et al.  Symbolically synthesizing small circuits , 2012, 2012 Formal Methods in Computer-Aided Design (FMCAD).

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

[22]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.