Advertisement

Synchronizing Strategies under Partial Observability

  • Kim Guldstrand Larsen
  • Simon Laursen
  • Jiří Srba
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8704)

Abstract

Embedded devices usually share only partial information about their current configurations as the communication bandwidth can be restricted. Despite this, we may wish to bring a failed device into a given predetermined configuration. This problem, also known as resetting or synchronizing words, has been intensively studied for systems that do not provide any information about their configurations. In order to capture more general scenarios, we extend the existing theory of synchronizing words to synchronizing strategies, and study the synchronization, short-synchronization and subset-to-subset synchronization problems under partial observability. We provide a comprehensive complexity analysis of these problems, concluding that for deterministic systems the complexity of the problems under partial observability remains the same as for the classical synchronization problems, whereas for nondeterministic systems the complexity increases already for systems with just two observations, as we can now encode alternation.

Keywords

Solar Panel Winning Strategy Synchronization Problem Initial Belief Partial Observability 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ananichev, D.S., Volkov, M.V.: Synchronizing monotonic automata. Theoretical Computer Science 327(3), 225–239 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Benenson, Y., Adar, R., Paz-Elizur, T., Livneh, Z., Shapiro, E.: Dna molecule provides a computing machine with both data and fuel. Proceedings of the National Academy of Sciences of the USA 100(5), 2191–2196 (2003)CrossRefGoogle Scholar
  3. 3.
    Boel, T.: Årsag til fejl på aalborg-satellit: Solcellerne vendte væk fra solen. Ingeniøren (Weekly national news magazine about engineering) (March 8, 2013), http://ing.dk/artikel/aarsag-til-fejl-paa-aalborg-satellit-solcellerne-vendte-vaek-fra-solen-156828
  4. 4.
    Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol. 3472. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  5. 5.
    Cassez, F., David, A., Larsen, K.G., Lime, D., Raskin, J.-F.: Timed control with observation based and stuttering invariant strategies. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 192–206. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Černý, J.: Poznámka k. homogénnym experimentom s konecnými automatmi. Mat. Fyz. Čas SAV 14, 208–215 (1964)zbMATHGoogle Scholar
  7. 7.
    Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games with imperfect information. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 287–302. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Chatterjee, K., Henzinger, T.A.: Semiperfect-information games. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 1–18. Springer, Heidelberg (2005)Google Scholar
  9. 9.
    Doyen, L., Massart, T., Shirmohammadi, M.: Infinite synchronizing words for probabilistic automata. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 278–289. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  10. 10.
    Doyen, L., Massart, T., Shirmohammadi, M.: Synchronizing objectives for markov decision processes. In: iWIGP. EPTCS, pp. 61–75 (2011)Google Scholar
  11. 11.
    Eppstein, D.: Reset sequences for monotonic automata. SIAM Journal on Computing 19(3), 500–510 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Fominykh, F., Volkov, M.: P(l)aying for synchronization. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 159–170. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  13. 13.
    Gill, A.: State-identification experiments in finite automata. Information and Control 4(2-3), 132–154 (1961)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Krichen, M.: State identification. In: Broy (ed.) [4], pp. 35–67Google Scholar
  15. 15.
    Martyugin, P.: Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata. Theory of Com. Systems, 1–12 (2013)Google Scholar
  16. 16.
    Moore, E.F.: Gedanken Experiments on Sequential Machines. In: Automata Studies, pp. 129–153. Princeton U. (1956)Google Scholar
  17. 17.
    Pomeranz, I., Reddy, S.M.: Application of homing sequences to synchronous sequential circuit testing. IEEE Trans. Computers 43(5) (1994)Google Scholar
  18. 18.
    Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences 29(2), 274–301 (1984)CrossRefzbMATHMathSciNetGoogle Scholar
  19. 19.
    Rintanen, J.: Complexity of conditional planning under partial observability and infinite executions. In: ECAI, pp. 678–683 (2012)Google Scholar
  20. 20.
    Rystsov, I.K.: Polynomial complete problems in automata theory. Information Processing Letters 16(3), 147–151 (1983)CrossRefzbMATHMathSciNetGoogle Scholar
  21. 21.
    Rystsov, I.K.: Rank of a finite automaton. Cybernetics and Systems Analysis 28(3), 323–328 (1992)CrossRefzbMATHMathSciNetGoogle Scholar
  22. 22.
    Sandberg, S.: Homing and synchronizing sequences. In: Broy (ed.) [4], pp. 5–33Google Scholar
  23. 23.
    Sipser, M.: Introduction to the Theory of Computation. Course Technology (2006)Google Scholar
  24. 24.
    Volkov, M.V.: Synchronizing automata and the Černý conjecture. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11–27. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Kim Guldstrand Larsen
    • 1
  • Simon Laursen
    • 1
  • Jiří Srba
    • 1
  1. 1.Department of Computer ScienceAalborg UniversityAalborg EastDenmark

Personalised recommendations