Algorithms for Synthesizing Priorities in Component-Based Systems

  • Chih-Hong Cheng
  • Saddek Bensalem
  • Yu-Fang Chen
  • Rongjie Yan
  • Barbara Jobstmann
  • Harald Ruess
  • Christian Buckl
  • Alois Knoll
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6996)


We present algorithms to synthesize component-based systems that are safe and deadlock-free using priorities, which define stateless-precedence between enabled actions. Our core method combines the concept of fault- localization (using safety-game) and fault-repair (using SAT for conflict resolution). For complex systems, we propose three complementary methods as preprocessing steps for priority synthesis, namely (a) data abstraction to reduce component complexities, (b) alphabet abstraction and \(\sharp\)-deadlock to ignore components, and (c) automated assumption learning for compositional priority synthesis.


Priority Rule Abstract System Membership Query Variable Swap Deadlock Detection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abujarad, F., Bonakdarpour, B., Kulkarni, S.: Parallelizing deadlock resolution in symbolic synthesis of distributed programs. In: PDMC 2009. EPTCS, vol. 14, pp. 92–106 (2009)Google Scholar
  2. 2.
    Aloul, F., Markov, I., Sakallah, K.: FORCE: a fast and easy-to-implement variable-ordering heuristic. In: GLSVLSI 2003, pp. 116–119. ACM, New York (2003)Google Scholar
  3. 3.
    Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Autili, M., Inverardi, P., Navarra, A., Tivoli, M.: SYNTHESIS: a tool for automatically assembling correct and distributed component-based systems. In: ICSE 2007, pp. 784–787. IEEE Computer Society, Los Alamitos (2007)Google Scholar
  5. 5.
    Balemi, S., Hoffmann, G., Gyugyi, P., Wong-Toi, H., Franklin, G.: Supervisory control of a rapid thermal multiprocessor. IEEE Transactions on Automatic Control 38(7), 1040–1059 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: SEFM 2006, pp. 3–12. IEEE, Los Alamitos (2006)Google Scholar
  7. 7.
    Bensalem, S., Bozga, M., Sifakis, J., Nguyen, T.: Compositional verification for component-based systems and application. In: Cha, S(S.), Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol. 5311, pp. 64–79. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  8. 8.
    Bensalem, S., Griesmayer, A., Legay, A., Nguyen, T.-H., Sifakis, J., Yan, R.-J.: D-Finder 2: Towards Efficient Correctness of Incremental Design. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 453–458. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  9. 9.
    Bonakdarpour, B., Bozga, M., Quilbeuf, J.: Automated distributed implementation of component-based models with priorities. In: EMSOFT 2011. ACM, New York (to appear, 2011)Google Scholar
  10. 10.
    Cheng, C.-H., Bensalem, S., Chen, Y.-F., Yan, R.-J., Jobstmann, B., Ruess, H., Buckl, C., Knoll, A.: Algorithms for synthesizing priorities in component-based systems (extended version), arXiv:1107.1383 [cs.LO] (2011)Google Scholar
  11. 11.
    Cheng, C.-H., Bensalem, S., Jobstmann, B., Yan, R.-J., Knoll, A., Ruess, H.: Model construction and priority synthesis for simple interaction systems. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 466–471. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  12. 12.
    Cheng, C.-H., Jobstmann, B., Buckl, C., Knoll, A.: On the hardness of priority synthesis. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 110–117. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  13. 13.
    Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NuSMV: a new symbolic model verifier. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 495–499. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  14. 14.
    Cobleigh, J., Giannakopoulou, D., Păsăreanu, C.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331–346. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  15. 15.
    Gößler, G., Sifakis, J.: Priority systems. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2003. LNCS, vol. 3188, pp. 314–329. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  17. 17.
    Graf, S., Peled, D., Quinton, S.: Achieving distributed control through model checking. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 396–409. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  18. 18.
    Holzmann, G.: The Spin Model Checker: Primer and Reference Manual. Addison-Wesley Professional, Reading (2004)Google Scholar
  19. 19.
    Iordache, M., Moody, J., Antsaklis, P.: Synthesis of deadlock prevention supervisors using Petri nets. IEEE Transactions on Robotics and Automation 18(1), 59–68 (2002)CrossRefGoogle Scholar
  20. 20.
    Li, Z., Zhou, M., Wu, N.: A survey and comparison of Petri net-based deadlock prevention policies for flexible manufacturing systems. IEEE Transactions on Systems, Man, and Cybernetics 38(2), 173–188 (2008)CrossRefGoogle Scholar
  21. 21.
    Pneuli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: FOCS 1990, vol. 2, pp. 746–757. IEEE Computer Society, Los Alamitos (1990)Google Scholar
  22. 22.
    Ramadge, P., Wonham, W.: The control of discrete event systems. Proceedings of the IEEE 77(1), 81–98 (1989)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Chih-Hong Cheng
    • 1
  • Saddek Bensalem
    • 2
  • Yu-Fang Chen
    • 3
  • Rongjie Yan
    • 4
  • Barbara Jobstmann
    • 2
  • Harald Ruess
    • 5
  • Christian Buckl
    • 5
  • Alois Knoll
    • 1
  1. 1.Department of InformaticsTechnischen Universität MünchenMünchenGermany
  2. 2.Verimag Laboratory, GrenobleFrance
  3. 3.Institute of Information ScienceAcademia SinicaTaipeiTaiwan
  4. 4.State Key Laboratory of Computer ScienceISCASBeijingChina
  5. 5.fortiss GmbHMünchenGermany

Personalised recommendations