On the Hardness of Priority Synthesis

  • Chih-Hong Cheng
  • Barbara Jobstmann
  • Christian Buckl
  • Alois Knoll
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6807)

Abstract

We study properties of priority synthesis [2], an automatic method to ensure desired safety properties in component-based systems using priorities. Priorities are a powerful concept to orchestrate components [3], e.g., the BIP framework [1] for designing and modeling embedded and autonomous systems is based on this concept.

We formulate priority synthesis for BIP systems using the automata-theoretic framework proposed by Ramadge and Wonham [5]. In this framework, priority synthesis results in searching for a supervisor from the restricted class of supervisors, in which each is solidly expressible using priorities. While priority-based supervisors are easier to use, e.g., they support the construction of distributed protocols, they are harder to compute. In this paper, we focus on the hardness of synthesizing priorities and show that finding a supervisor based on priorities that ensures deadlock freedom of the supervised system is NP-complete.

References

  1. 1.
    Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: Proceedings of the 4th IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), pp. 3–12. IEEE Computer Society Press, New York (2006)CrossRefGoogle Scholar
  2. 2.
    Cheng, C.-H., Bensalem, S., Jobstmann, B., Yan, R., 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
  3. 3.
    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
  4. 4.
    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
  5. 5.
    Ramadge, P., Wonham, W.: The control of discrete event systems. Proceedings of the IEEE 77(1), 81–98 (1989)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Chih-Hong Cheng
    • 1
  • Barbara Jobstmann
    • 2
  • Christian Buckl
    • 3
  • Alois Knoll
    • 1
  1. 1.Department of InformaticsTechnischen Universität MünchenGarchingGermany
  2. 2.Verimag LaboratoryGièresFrance
  3. 3.fortiss GmbHMunichGermany

Personalised recommendations