Abstract
In hard real-time systems, where system complexity meets stringent timing constraints, the task of system-level synthesis has become more and more challenging. As a remedy, we introduce an SMT-based system synthesis approach where the Boolean solver determines a static binding of computational tasks to computing resources and a routing of messages over the interconnection network while the theory solver computes a global time-triggered schedule based on the Boolean solver’s solution. The binding and routing is stated as an optimization problem in order to refine the solution found by the Boolean solver such that the theory solver is more likely to find a feasible schedule within a reasonable amount of time. In this paper, we enhance this approach by applying domain-specific heuristics to the optimization problem. Our experiments show that by utilizing domain knowledge we can increase the number of solved instances significantly.
T. Schaub—Affiliated with Simon Fraser University, Canada, and IIIS Griffith University, Australia.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Reimann, F., Glaß, M., Haubelt, C., Eberl, M., Teich, J.: Improving platform-based system synthesis by satisfiability modulo theories solving. In: Proceedings of CODES+ISSS, pp. 135–144 (2010)
Biewer, A., Andres, B., Gladigau, J., Schaub, T., Haubelt, C.: A symbolic system synthesis approach for hard real-time systems based on coordinated SMT-solving. In: Proceedings of DATE, pp. 357–362 (2015)
Gebser, M., Kaufmann, B., Otero, R., Romero, J., Schaub, T., Wanko, P.: Domain-specific heuristics in answer set programming. In: Proceedings of AAAI, pp. 350–356 (2013)
Reimann, F., Lukasiewycz, M., Glaß, M., Haubelt, C., Teich, J.: Symbolic system synthesis in the presence of stringent real-time constraints. In: Proceedings of DAC, pp. 393–398 (2011)
Lukasiewycz, M., Chakraborty, S.: Concurrent architecture and schedule optimization of time-triggered automotive systems. In: Proceedings of CODES+ISSS, pp. 383–392 (2012)
Andres, B., Gebser, M., Schaub, T., Haubelt, C., Reimann, F., Glaß, M.: Symbolic system synthesis using answer set programming. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 79–91. Springer, Heidelberg (2013)
Biewer, A., Munk, P., Gladigau, J., Haubelt, C.: On the influence of hardware design options on schedule synthesis in time-triggered real-time systems. In: Proceedings of MBMV, pp. 105–114 (2015)
Ostrowski, M., Schaub, T.: ASP modulo CSP: the clingcon system. Theory Pract. Logic Program. 12(4–5), 485–503 (2012)
Järvisalo, M., Junttila, T., Niemelä, I.: Unrestricted vs restricted cut in a tableau method for boolean circuits. Ann. Math. Artif. Intell. 44(4), 373–399 (2005)
Dutertre, B.: Yices 2.2. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 737–744. Springer, Heidelberg (2014)
de Moura, L., Bjørner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)
Janhunen, T., Liu, G., Niemelä, I.: Tight integration of non-ground answer set programming and satisfiability modulo theories. In: Proceedings of GTTV, pp. 1–13 (2011)
Potassco website. http://potassco.sourceforge.net
Acknowledgments
This work was partly funded by DFG (550/9).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Andres, B., Biewer, A., Romero, J., Haubelt, C., Schaub, T. (2015). Improving Coordinated SMT-Based System Synthesis by Utilizing Domain-Specific Heuristics. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-23264-5_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23263-8
Online ISBN: 978-3-319-23264-5
eBook Packages: Computer ScienceComputer Science (R0)