References

  1. Parosh Aziz Abdulla & Bengt Jonsson (1996): Verifying Programs with Unreliable Channels. Inf. Comput. 127(2), pp. 91–101, doi:10.1006/inco.1996.0053.
  2. Lakhdar Akroun & Gwen Salaün (2018): Automated verification of automata communicating via FIFO and bag buffers. Formal Methods Syst. Des. 52(3), pp. 260–276, doi:10.1007/s10703-017-0285-8.
  3. Samik Basu & Tevfik Bultan (2016): On deciding synchronizability for asynchronously communicating systems. Theor. Comput. Sci. 656, pp. 60–75, doi:10.1016/j.tcs.2016.09.023.
  4. Ahmed Bouajjani, Constantin Enea, Kailiang Ji & Shaz Qadeer (2018): On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony. In: Hana Chockler & Georg Weissenbacher: Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part II, Lecture Notes in Computer Science 10982. Springer, pp. 372–391, doi:10.1007/978-3-319-96142-2_23.
  5. Gérard Cécé & Alain Finkel (2005): Verification of programs with half-duplex communication. Inf. Comput. 202(2), pp. 166–190, doi:10.1016/j.ic.2005.05.006.
  6. Gérard Cécé, Alain Finkel & S. Purushothaman Iyer (1996): Unreliable Channels are Easier to Verify Than Perfect Channels. Inf. Comput. 124(1), pp. 20–31, doi:10.1006/inco.1996.0003.
  7. Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux & Filip Mazowiecki (2021): The Reachability Problem for Petri Nets Is Not Elementary. J. ACM 68(1), pp. 7:1–7:28, doi:10.1145/3422822.
  8. Pierre-Malo Deniélou & Nobuko Yoshida (2012): Multiparty Session Types Meet Communicating Automata. In: Helmut Seidl: Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings, Lecture Notes in Computer Science 7211. Springer, pp. 194–213, doi:10.1007/978-3-642-28869-2_10.
  9. Cinzia Di Giusto, Laetitia Laversa & Étienne Lozes (2020): On the k-synchronizability of Systems. In: FOSSACS 2020, LNCS 12077, pp. 157–176, doi:10.1007/978-3-030-45231-5_9.
  10. Manuel Fähndrich, Mark Aiken, Chris Hawblitzel, Orion Hodson, Galen C. Hunt, James R. Larus & Steven Levi (2006): Language support for fast and reliable message-based communication in singularity OS. In: Yolande Berbers & Willy Zwaenepoel: Proceedings of the 2006 EuroSys Conference, Leuven, Belgium, April 18-21, 2006. ACM, pp. 177–190, doi:10.1145/1217935.1217953.
  11. Alain Finkel & Étienne Lozes (2017): Synchronizability of Communicating Finite State Machines is not Decidable. In: Ioannis Chatzigiannakis, Piotr Indyk, Anca Muscholl & Fabian Kuhn: Proceedings of the 44th International Colloquium on Automata, Languages and Programming (ICALP'17), Leibniz International Proceedings in Informatics 80. Leibniz-Zentrum für Informatik, Warsaw, Poland, pp. 122:1–122:14, doi:10.4230/LIPIcs.ICALP.2017.122.
  12. Blaise Genest, Dietrich Kuske & Anca Muscholl (2007): On Communicating Automata with Bounded Channels. Fundam. Inform. 80(1-3), pp. 147–167. Available at http://content.iospress.com/articles/fundamenta-informaticae/fi80-1-3-09.
  13. Alexander Heußner, Tristan Le Gall & Grégoire Sutre (2012): McScM: A General Framework for the Verification of Communicating Machines. In: Cormac Flanagan & Barbara König: Tools and Algorithms for the Construction and Analysis of Systems - 18th International Conference, TACAS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings, Lecture Notes in Computer Science 7214. Springer, pp. 478–484, doi:10.1007/978-3-642-28756-5_34.
  14. Kohei Honda (1993): Types for Dyadic Interaction. In: Eike Best: CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings, Lecture Notes in Computer Science 715. Springer, pp. 509–523, doi:10.1007/3-540-57208-2_35.
  15. Kohei Honda, Vasco Thudichum Vasconcelos & Makoto Kubo (1998): Language Primitives and Type Discipline for Structured Communication-Based Programming. In: Chris Hankin: Programming Languages and Systems - ESOP'98, 7th European Symposium on Programming, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings, Lecture Notes in Computer Science 1381. Springer, pp. 122–138, doi:10.1007/BFb0053567.
  16. Kohei Honda, Nobuko Yoshida & Marco Carbone (2016): Multiparty Asynchronous Session Types. J. ACM 63(1), pp. 9:1–9:67, doi:10.1145/2827695.
  17. ITU-TS: ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS (1999).
  18. Dietrich Kuske & Anca Muscholl (2019): Communicating Automata. In: J.-E. Pin: Handbook of Automata: from Mathematics to Applications (AutoMathA). European Science Foundation. Available at https://eiche.theoinf.tu-ilmenau.de/kuske/Submitted/cfm-final.pdf.
  19. Markus Lohrey & Anca Muscholl (2004): Bounded MSC communication. Inf. Comput. 189(2), pp. 160–181, doi:10.1016/j.ic.2003.10.002.
  20. Étienne Lozes & Jules Villard (2011): Reliable Contracts for Unreliable Half-Duplex Communications. In: WS-FM 2011, LNCS 7176, pp. 2–16, doi:10.1007/978-3-642-29834-9_2.
  21. Jan K. Pachl (2003): Reachability problems for communicating finite state machines. CoRR cs.LO/0306121. Available at http://arxiv.org/abs/cs/0306121.
  22. Alceste Scalas & Nobuko Yoshida (2019): Less is more: multiparty session types revisited. Proc. ACM Program. Lang. 3(POPL), pp. 30:1–30:29, doi:10.1145/3290343.
  23. Philippe Schnoebelen (2002): Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. 83(5), pp. 251–261, doi:10.1016/S0020-0190(01)00337-4.
  24. Philippe Schnoebelen (2021): On Flat Lossy Channel Machines. In: Christel Baier & Jean Goubault-Larrecq: 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (Virtual Conference), LIPIcs 183. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 37:1–37:22, doi:10.4230/LIPIcs.CSL.2021.37.
  25. Koushik Sen & Mahesh Viswanathan (2006): Model Checking Multithreaded Programs with Asynchronous Atomic Methods. In: Thomas Ball & Robert B. Jones: Computer Aided Verification. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 300–314, doi:10.1007/11817963_29.
  26. Salvatore La Torre, P. Madhusudan & Gennaro Parlato (2008): Context-Bounded Analysis of Concurrent Queue Systems. In: C. R. Ramakrishnan & Jakob Rehof: Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings, Lecture Notes in Computer Science 4963. Springer, pp. 299–314, doi:10.1007/978-3-540-78800-3_21.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org