PARTY: parameterized synthesis of token rings

Authors:
Ayrat Khalimov;Swen Jacobs;Roderick Bloem
Affiliations:
Graz University of Technology, Austria;Graz University of Technology, Austria;Graz University of Technology, Austria
Venue:
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Year:
2013

Citing 9
Cited 0

Reducing Model Checking of the Many to the Few

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Optimizations for LTL Synthesis

FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
Specify, Compile, Run: Hardware from PSL

Electronic Notes in Theoretical Computer Science (ENTCS)
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Unbeast: symbolic bounded synthesis

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Lazy synthesis

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
LTL to büchi automata translation: fast and more deterministic

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Parameterized synthesis

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Acacia+, a tool for LTL synthesis

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.