Blog
About

7
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Realisability of Pomsets via Communicating Automata

      Preprint

      ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Pomsets are a model of concurrent computations introduced by Pratt. They can provide a syntax-oblivious description of semantics of coordination models based on asynchronous message-passing, such as Message Sequence Charts (MSCs). In this paper, we study conditions that ensure a specification expressed as a set of pomsets can be faithfully realised via communicating automata. Our main contributions are (i) the definition of a realisability condition accounting for termination soundness, (ii) conditions for global specifications with "multi-threaded" participants, and (iii) the definition of realisability conditions that can be decided directly over pomsets. A positive by-product of our approach is the efficiency gain in the verification of the realisability conditions obtained when restricting to specific classes of choreographies characterisable in term of behavioural types.

          Related collections

          Most cited references 14

          • Record: found
          • Abstract: not found
          • Article: not found

          Modeling concurrency with partial orders

           Vaughan Pratt (1986)
            Bookmark
            • Record: found
            • Abstract: not found
            • Book Chapter: not found

            Stack Size Analysis for Interrupt-Driven Programs

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Multiparty Asynchronous Session Types

                Bookmark

                Author and article information

                Journal
                04 October 2018
                Article
                10.4204/EPTCS.279.6
                1810.02469

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                Custom metadata
                EPTCS 279, 2018, pp. 37-51
                In Proceedings ICE 2018, arXiv:1810.02053
                cs.LO cs.SE
                EPTCS

                Software engineering, Theoretical computer science

                Comments

                Comment on this article