Document Open Access Logo

Automated Synthesis: a Distributed Viewpoint

Author Anca Muscholl

PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2017.3.pdf
  • Filesize: 264 kB
  • 5 pages

Document Identifiers

Author Details

Anca Muscholl

Cite As Get BibTex

Anca Muscholl. Automated Synthesis: a Distributed Viewpoint. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 3:1-3:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.FSTTCS.2017.3

Abstract

Distributed algorithms are inherently hard to get right, and a major challenge is to come up with automated techniques for error detection and recovery. The talk will survey recent results on the synthesis of distributed monitors and controllers.

Subject Classification

Keywords
  • Synthesis
  • distributed program

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Alonzo Church. Logic, arithmetics, and automata. Proceedings of the International Congress of Mathematicians, 1962. Google Scholar
  2. Javier Esparza and Jörg Desel. On negotiation as concurrency primitive. In Proc. CONCUR'13, volume 8052 of LNCS, pages 440-454. Springer, 2013. Google Scholar
  3. Javier Esparza, Anca Muscholl, and Igor Walukiewicz. Static analysis of deterministic negotiations. In Proc. LICS'17, pages 1-12. IEEE Computer Society, 2017. Google Scholar
  4. Bernd Finkbeiner and Ernst-Ruediger Olderog. Petri games: Synthesis of distributed systems with causal memory. In GandALF'14, EPTCS, pages 217-230, 2014. Google Scholar
  5. Bernd Finkbeiner and Sven Schewe. Uniform distributed synthesis. In LICS'05, pages 321-330. IEEE Computer Society, 2005. Google Scholar
  6. Paul Gastin, Benjamin Lerman, and Marc Zeitoun. Distributed games with causal memory are decidable for series-parallel systems. In FSTTCS'04, volume 3328 of LNCS, pages 275-286. Springer, 2004. Google Scholar
  7. Blaise Genest, Hugo Gimbert, Anca Muscholl, and Igor Walukiewicz. Optimal Zielonka-type construction of deterministic asynchronous automata. In ICALP'10, volume 6199 of LNCS, pages 52-63. Springer, 2010. Google Scholar
  8. Blaise Genest, Hugo Gimbert, Anca Muscholl, and Igor Walukiewicz. Asynchronous games over tree architectures. In ICALP'13, volume 7966 of LNCS, pages 275-286. Springer, 2013. Google Scholar
  9. Patrice Godefroid and Pierre Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods in System Design, 2(2):149-164, 1993. Google Scholar
  10. Klaus Havelund and Giles Reger. Runtime verification logics a language design perspective. In Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday., volume 10460 of LNCS. Springer, 2017. Google Scholar
  11. Orna Kupferman and Moshe Y. Vardi. Church’s problem revisited. The Bulletin of Symbolic Logic, 5(2):245-263, 1999. Google Scholar
  12. Martin Leucker and Christian Schallhart. A brief account of runtime verification. J. Log. Algebr. Program., 78(5):293-303, 2009. Google Scholar
  13. P. Madhusudan, P. S. Thiagarajan, and S. Yang. The MSO theory of connectedly communicating processes. In FSTTCS'05, volume 3821 of LNCS, pages 201-212. Springer, 2005. Google Scholar
  14. P. Madhusudan and P.S. Thiagarajan. Distributed control and synthesis for local specifications. In ICALP'01, volume 2076 of LNCS, pages 396-407. Springer, 2001. Google Scholar
  15. Antoni Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977. Google Scholar
  16. Anca Muscholl and Igor Walukiewicz. Distributed synthesis for acyclic architectures. In FSTTCS'14, volume 29 of LIPIcs, pages 639-651. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. Google Scholar
  17. Doron A. Peled. All from one, one for all: on model checking using representatives. In CAV'93, LNCS, pages 409-423. Springer, 1993. Google Scholar
  18. Amir Pnueli and Roni Rosner. Distributed reactive systems are hard to synthesize. In FOCS'90, pages 746-757. IEEE Computer Society, 1990. Google Scholar
  19. Koushik Sen, Abhay Vardhan, Gul Agha, and Grigore Rosu. Efficient decentralized monitoring of safety in distributed systems. In International Conference on Software Engineering (ICSE'04)), pages 418-427. IEEE Computer Society, 2004. Google Scholar
  20. Wolfgang Thomas. Church’s problem and a tour through automata theory. In Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Springer, 2008. Google Scholar
  21. Antti Valmari. Stubborn sets for reduced state space generation. In Advances in Petri Nets 1990, number 483 in LNCS, pages 491-515, 1991. Google Scholar
  22. W. Zielonka. Notes on finite asynchronous automata. RAIRO-Theoretical Informatics and Applications, 21:99-135, 1987. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact