Advertisement

On Distributed Program Specification and Synthesis in Architectures with Cycles

  • Julien Bernet
  • David Janin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4229)

Abstract

In this paper, we consider discrete distributed synthesis pro- blems, as defined by Pnueli and Rosner[17], on possibly cyclic architectures with zero-delay semantics and global specifications.

We describe a uniform (and complete) translation of these problems into distributed games problems. We prove the correctness of this translation and we also obtain, in this setting, a characterization of distributed architectures with decidable synthesis problems.

It shall be noted that, as opposed to former approaches, zero-delay semantics requires a specific treatment for modeling instantaneous value propagation. Moreover, cyclic dependencies with zero-delay semantics involve equations with potentially many solutions. Accordingly, several variants of the distributed synthesis problem are proposed and studied.

Keywords

Local Behavior Global Behavior Sequential Function Discrete Event System Environment Position 
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.

References

  1. 1.
    de Alfaro, L., Henzinger, T.A., Mang, F.Y.C.: The control of synchronous systems, part II. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 566–582. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    Arnold, A., Vincent, A., Walukiewicz, I.: Games for synthesis of controlers with partial observation. Theoretical Comp. Science 303(1), 7–34 (2003)CrossRefMATHGoogle Scholar
  3. 3.
    Bernet, J., Janin, D.: Tree automata and discrete distributed games. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 540–551. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems. Kluwer Academic Publishers, Dordrecht (1999)CrossRefMATHGoogle Scholar
  5. 5.
    Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: IEEE Symp. on Logic in Computer Science (LICS), pp. 321–330 (2005)Google Scholar
  6. 6.
    Gastin, P., Lerman, B., Zeitoun, M.: Causal memory distributed games are decidable for series-parallel systems. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, Springer, Heidelberg (2004)Google Scholar
  7. 7.
    Gastin, P., Lerman, B., Zeitoun, M.: Distributed games and distributed control for asynchronous systems. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 455–465. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Hennessy, J.L., Patterson, D.A.: Computer organization and design: the Hardware/software interface, 2nd edn. Morgan Kaufmann Publishers Inc., San Francisco (1998)MATHGoogle Scholar
  9. 9.
    IEEE Std 1076-1993. IEEE Standard VHDL (1993)Google Scholar
  10. 10.
    Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: IEEE Symp. on Logic in Computer Science (LICS), pp. 389–398 (2001)Google Scholar
  11. 11.
    Madhusudan, P.: Control and Synthesis of Open Reactive Systems. PhD thesis, University of Madras (2001)Google Scholar
  12. 12.
    Madhusudan, P., Thiagarajan, P.S.: Distributed controller synthesis for local specifications. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, p. 396. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    Madhusudan, P., Thiagarajan, P.S.: A decidable class of asynchronous distributed controllers. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 145–160. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  14. 14.
    Mohalik, S., Walukiewicz, I.: Distributed games. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 338–351. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  15. 15.
    Peterson, G.L., Reif, J.H.: Multiple-person alternation. In: 20th Annual IEEE Symposium on Foundations of Computer Sciences, pp. 348–363 (October 1979)Google Scholar
  16. 16.
    Peterson, G.L., Reif, J.H., Azhar, S.: Decision algorithms for multiplayer non-cooperative games of incomplete information. Computers and Mathematics with Applications 43, 179–206 (2002)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: IEEE Symposium on Foundations of Computer Science, pp. 746–757 (1990)Google Scholar
  18. 18.
    Rabin, M.O.: Decidability of second order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)MathSciNetMATHGoogle Scholar
  19. 19.
    Reif, J.H.: Universal games of incomplete information. In: 11th Annual ACM Symposium on Theory of Computing, pp. 288–308 (1979)Google Scholar
  20. 20.
    Rudie, K., Wonham, W.M.: Think globally, act locally: Decentralized supervisory control. IEEE Transactions on Automatic Control 37(11), 1692–1708 (1992)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Julien Bernet
    • 1
  • David Janin
    • 1
  1. 1.LaBRI, Université de Bordeaux ITalence CedexFrance

Personalised recommendations