Specification decomposition for synthesis from libraries of LTL Assume/Guarantee contracts

Contract-Based Design is a methodology that allows for compositional design of complex systems. Given a contract representing a specification, it is possible to formally satisfy it by composing a number of simpler contracts. When these simpler contracts are chosen from a library of existing solutions, we talk about synthesis from contract libraries. There are techniques to automate the synthesis process, but they are computationally intensive, especially for complex specifications. In this paper, we describe an efficient technique to partition a specification, i.e., an LTL-based Assume/Guarantee contract, in a number of simpler sub-specifications which can be satisfied independently. Once all these smaller problems are solved, it is possible to safely merge their solutions to satisfy the original specification. We show the effectiveness of our technique in an industrial case study.

[1]  Marcello M. Bonsangue,et al.  Formal Methods for Components and Objects - 8th International Symposium, FMCO 2009, Eindhoven, The Netherlands, November 4-6, 2009. Revised Selected Papers , 2010, FMCO.

[2]  Alberto L. Sangiovanni-Vincentelli,et al.  Are interface theories equivalent to contract theories? , 2014, 2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE).

[3]  Alberto L. Sangiovanni-Vincentelli,et al.  Constrained Synthesis from Component Libraries , 2016, FACS.

[4]  Ufuk Topcu,et al.  Compositional Synthesis with Parametric Reactive Controllers , 2016, HSCC.

[5]  Ian Moir,et al.  Aircraft Systems: Mechanical, Electrical, and Avionics Subsystems Integration , 2008 .

[6]  Alberto L. Sangiovanni-Vincentelli,et al.  Turning coders into makers: the promise of embedded design generation , 2017, SCF.

[7]  Stavros Tripakis.  Automated Module Composition , 2003, TACAS.

[8]  Roberto Passerone,et al.  Multiple Viewpoint Contract-Based Specification and Design , 2008, FMCO.

[9]  Thomas A. Henzinger,et al.  Decomposing refinement proofs using assume-guarantee reasoning , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[10]  Frank D. Valencia,et al.  Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

[11]  Paulo Tabuada,et al.  Decomposing controller synthesis for safety specifications , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[12]  Alberto L. Sangiovanni-Vincentelli,et al.  Taming Dr. Frankenstein: Contract-Based Design for Cyber-Physical Systems , 2012, Eur. J. Control.

[13]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[14]  Alberto L. Sangiovanni-Vincentelli,et al.  Library-based scalable refinement checking for contract-based design , 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[15]  Philippe Schnoebelen,et al.  The Complexity of Temporal Logic Model Checking , 2002, Advances in Modal Logic.