Automated Synthesis of Distributed Controllers | SpringerLink
Skip to main content
Springer Nature Link
Log in

Automated Synthesis of Distributed Controllers

  • Conference paper
  • First Online:
Automata, Languages, and Programming (ICALP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9135))

Included in the following conference series:

Abstract

Synthesis is a particularly challenging problem for concurrent programs. At the same time it is a very promising approach, since concurrent programs are difficult to get right, or to analyze with traditional verification techniques. This paper gives an introduction to distributed synthesis in the setting of Mazurkiewicz traces, and its applications to decentralized runtime monitoring.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abdulla, P., Aronis, S., Jonsson, B., Sagonas, K.: Optimal dynamic partial order reduction. In: POPL 2014, pp. 373–384. ACM (2014)

    Google Scholar 

  2. Akshay, S., Dinca, I., Genest, B., Stefanescu, A.: Implementing realistic asynchronous automata. In: FSTTCS 2013, LIPIcs, pp. 213–224. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)

    Google Scholar 

  3. Alur, R., McMillan, K., Peled, D.: Model-checking of correctness conditions for concurrent objects. In: LICS 1996, pp. 219–228. IEEE (1996)

    Google Scholar 

  4. Armstrong, J.: Programming Erlang: Software for a Concurrent World. Pragmatic Bookshelf (2007)

    Google Scholar 

  5. Bollig, B., Grindei, M.-L., Habermehl, P.: Realizability of concurrent recursive programs. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 410–424. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Černý, P., Henzinger, T.A., Radhakrishna, A., Ryzhyk, L., Tarrach, T.: Efficient synthesis for concurrency by semantics-preserving transformations. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 951–967. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Church, A.: Logic, arithmetics, and automata. In: Proceedings of the International Congress of Mathematicians (1962)

    Google Scholar 

  8. Cori, R., Métivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation 106, 159–202 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Darondeau, P., Ricker, L.: Distributed control of discrete-event systems: A first step. Transactions on Petri Nets and Other Models of Concurrency 6, 24–45 (2012)

    Article  Google Scholar 

  10. Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)

    Google Scholar 

  11. Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures: Parts i and ii. Acta Informatica 27(4), 315–368 (1989)

    Article  MathSciNet  Google Scholar 

  12. Farzan, A., Madhusudan, P.: Monitoring atomicity in concurrent programs. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 52–65. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: LICS 2005, pp. 321–330. IEEE (2005)

    Google Scholar 

  14. Gastin, P., Lerman, B., Zeitoun, M.: Distributed games with causal memory are decidable for series-parallel systems. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 275–286. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Gastin, P., Sznajder, N.: Fair synthesis for asynchronous distributed systems. ACM Transactions on Computational Logic 14(2), 9 (2013)

    Article  MathSciNet  Google Scholar 

  16. Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Optimal Zielonka-type construction of deterministic asynchronous automata. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 52–63. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Asynchronous games over tree architectures. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 275–286. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  18. Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput. 204(6), 920–956 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  19. Genest, B., Muscholl, A.: Constructing exponential-size deterministic Zielonka automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 565–576. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  20. Godefroid, P., Wolper, P.: Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods in System Design 2(2), 149–164 (1993)

    Article  MATH  Google Scholar 

  21. Gutierrez, J., Winskel, G.: On the determinacy of concurrent games on event structures with infinite winning sets. J. Comput. Syst. Sci. 80(6), 1119–1137 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  22. Henriksen, J.G., Mukund, M., Kumar, K.N., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. Inf. Comput. 202(1), 1–38 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  23. Krishna, S., Muscholl, A.: A quadratic construction for Zielonka automata with acyclic communication structure. Theoretical Computer Science 503, 109–114 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  24. Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: LICS 2001, pp. 389–398. IEEE (2001)

    Google Scholar 

  25. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS 2007, pp. 161–170. IEEE (2007)

    Google Scholar 

  26. La Torre, S., Parlato, G.: Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width. In: FSTTCS 2012, LIPIcs, pp. 173–184. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)

    Google Scholar 

  27. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Operating Systems 21(7), 558–565 (1978)

    MATH  Google Scholar 

  28. 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, pp. 396–407. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  29. Madhusudan, P., Thiagarajan, P.S., Yang, S.: The MSO theory of connectedly communicating processes. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 201–212. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  30. Mattern, F.: Virtual time and global states of distributed systems. In: International Workshop on Parallel and Distributed Algorithms, pp. 215–226. Elsevier (1989)

    Google Scholar 

  31. Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus (1977)

    Google Scholar 

  32. Melliès, P.-A.: Asynchronous games 2: The true concurrency of innocence. TCS 358(2–3), 200–228 (2006)

    Article  MATH  Google Scholar 

  33. Mukund, M., Sohoni, M.A.: Keeping track of the latest gossip in a distributed system. Distributed Computing 10(3), 137–148 (1997)

    Article  Google Scholar 

  34. Muscholl, A., Walukiewicz, I.: Distributed synthesis for acyclic architectures. In: FSTTCS 2014, LIPIcs, pp. 639–651. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)

    Google Scholar 

  35. Odersky, M., Rompf, T.: Unifying functional and object-oriented programming with Scala. Communications of the ACM 57(4), 76–86 (2014)

    Article  Google Scholar 

  36. Odersky, M., Spoon, L., Venners, B.: Programming in Scala. Artima (2010)

    Google Scholar 

  37. Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 409–423. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  38. Peterson, G.L., Reif, J.H.: Multi-person alternation. In: FOCS 1979, pp. 348–363. IEEE (1979)

    Google Scholar 

  39. Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: FOCS 1990. IEEE (1990)

    Google Scholar 

  40. Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93–107. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  41. Rabin, M.O.: Automata on Infinite Objects and Church’s Problem. American Mathematical Society, Providence (1972)

    MATH  Google Scholar 

  42. Ramadge, P., Wonham, W.: The control of discrete event systems. Proceedings of the IEEE 77(2), 81–98 (1989)

    Article  Google Scholar 

  43. Sen, K., Vardhan, A., Agha, G., Rosu, G.: Decentralized runtime analysis of multithreaded applications. In: International Parallel and Distributed Processing Symposium (IPDPS 2006). IEEE (2006)

    Google Scholar 

  44. Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) Advances in Petri Nets 1990. LNCS, vol. 483, pp. 491–515. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  45. Zielonka, W.: Notes on finite asynchronous automata. RAIRO-Theoretical Informatics and Applications 21, 99–135 (1987)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, University of Bordeaux, Bordeaux, France

    Anca Muscholl

Authors
  1. Anca Muscholl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anca Muscholl .

Editor information

Editors and Affiliations

  1. Reykjavik University, Reykjavik, Iceland

    Magnús M. Halldórsson

  2. Kyoto University, Kyoto, Japan

    Kazuo Iwama

  3. The University of Tokyo, Tokyo, Japan

    Naoki Kobayashi

  4. Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    Bettina Speckmann

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Muscholl, A. (2015). Automated Synthesis of Distributed Controllers. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47666-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47666-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47665-9

  • Online ISBN: 978-3-662-47666-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation