Diversely enumerating system-level architectures

Embedded systems are highly constrained, and modern constraint solvers can be used to synthesize architectures satisfying constraints. However, solvers may enumerate solutions with bias yielding a skewed view of the solution space. In this paper we formalize enumerators, enumeration bias, and build empirically diverse enumerators. An ideal diverse enumerator uniformly draws equivalence classes of solutions. We develop an algorithm, called symmetry-directed randomized partitioning, for constructing empirically diverse enumerators from modern unmodified constraint solvers. We show that our diverse enumerator is significantly closer to the ideal compared to baseline and randomized solvers.

[1]  Lothar Thiele,et al.  Maximizing population diversity in single-objective optimization , 2011, GECCO '11.

[2]  A. Basu,et al.  Statistical Inference: The Minimum Distance Approach , 2011 .

[3]  Pablo Castells,et al.  Personalized diversification of search results , 2012, SIGIR '12.

[4]  Charles L. A. Clarke,et al.  Novelty and diversity in information retrieval evaluation , 2008, SIGIR '08.

[5]  Insup Lee,et al.  A Verifiable Language for Programming Real-Time Communication Schedules , 2007, IEEE Transactions on Computers.

[6]  Emina Torlak,et al.  Kodkod: A Relational Model Finder , 2007, TACAS.

[7]  Krzysztof Czarnecki,et al.  Evolution of the Linux Kernel Variability Model , 2010, SPLC.

[8]  Paul Le Guernic,et al.  Polychronous controller synthesis from MARTE CCSL timing specifications , 2011, Ninth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMPCODE2011).

[9]  N. L. Johnson,et al.  Discrete Multivariate Distributions , 1998 .

[10]  Roberto Bruttomesso,et al.  The OpenSMT Solver , 2010, TACAS.

[11]  Olivier Dubois,et al.  Upper bounds on the satisfiability threshold , 2001, Theor. Comput. Sci..

[12]  Oded Maler,et al.  Approximating the Pareto Front of Multi-criteria Optimization Problems , 2010, TACAS.

[13]  Igor L. Markov,et al.  Shatter: efficient symmetry-breaking for Boolean satisfiability , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

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

[15]  Martin Lukasiewycz,et al.  Symbolic system synthesis in the presence of stringent real-time constraints , 2011, 2011 48th ACM/EDAC/IEEE Design Automation Conference (DAC).

[16]  Lothar Thiele,et al.  Timed model checking with abstractions: towards worst-case response time analysis in resource-sharing manycore systems , 2012, EMSOFT '12.

[17]  Ana Sokolova,et al.  Distributed, Modular HTL , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[18]  Rolf Ernst,et al.  TDMA time slot and turn optimization with evolutionary search techniques , 2005, Design, Automation and Test in Europe.

[19]  Alexander Nadel,et al.  Generating Diverse Solutions in SAT , 2011, SAT.

[20]  Ethan K. Jackson,et al.  Components, platforms and possibilities: towards generic automation for MDA , 2010, EMSOFT '10.

[21]  Panagiotis Manolios,et al.  Synthesizing Cyber-Physical Architectural Models with Real-Time Constraints , 2011, CAV.

[22]  Toby Walsh,et al.  Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications , 2009 .

[23]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

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

[25]  Gabor Karsai,et al.  Constraint-Based Design-Space Exploration and Model Synthesis , 2003, EMSOFT.