Skip to main content
SpringerLink
Log in

On Distributed Monitoring and Synthesis

  • Conference paper
  • First Online:
Evolving Computability (CiE 2015)

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

Included in the following conference series:

  • 618 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

References

  1. Akka. http://akka.io/

  2. Erlang programming language. http://www.erlang.org/

  3. Scala programming language. http://www.scala-lang.org/

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

    Google Scholar 

  5. 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 

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

    Google Scholar 

  7. 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 

  8. Č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 

  9. Church, A.: Logic, arithmetics, and automata. In: Proceedings of the International Congress of Mathematicians, pp. 23–35 (1962)

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. 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 

  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 Trans. Comput. Log. 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. Form. Meth. Syst. Des. 2(2), 149–164 (1993)

    Article  MATH  Google Scholar 

  21. 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 

  22. Krishna, S., Muscholl, A.: A quadratic construction for Zielonka automata with acyclic communication structure. Theor. Comput. Sci. 503, 109–114 (2013)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  24. 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 

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

    MATH  Google Scholar 

  26. 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 

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

    Google Scholar 

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

    Article  Google Scholar 

  29. 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 

  30. Peled, D.A.: 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 

  31. 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 

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

    MATH  Google Scholar 

  33. Ramadge, P.J.G., Wonham, W.M.: The control of discrete event systems. Proc. IEEE 77(2), 81–98 (1989)

    Article  Google Scholar 

  34. Stefanescu, A.: Automatic synthesis of distributed transition systems. Ph.D. thesis, Universität Stuttgart (2006)

    Google Scholar 

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

    Chapter  Google Scholar 

  36. Zielonka, W.: Notes on finite asynchronous automata. RAIRO-Theor. Inf. Appl. 21, 99–135 (1987)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, University of Bordeaux, Talence, 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. Department of Computer Science, Swansea University, Swansea, United Kingdom

    Arnold Beckmann

  2. University of Bucharest, Bucharest, Romania

    Victor Mitrana

  3. Sofia University, Sofia, Bulgaria

    Mariya Soskova

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Muscholl, A. (2015). On Distributed Monitoring and Synthesis. In: Beckmann, A., Mitrana, V., Soskova, M. (eds) Evolving Computability. CiE 2015. Lecture Notes in Computer Science(), vol 9136. Springer, Cham. https://doi.org/10.1007/978-3-319-20028-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20028-6_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20027-9

  • Online ISBN: 978-3-319-20028-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation