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

      Representing Conversations for Scalable Overhearing

      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

          Open distributed multi-agent systems are gaining interest in the academic community and in industry. In such open settings, agents are often coordinated using standardized agent conversation protocols. The representation of such protocols (for analysis, validation, monitoring, etc) is an important aspect of multi-agent applications. Recently, Petri nets have been shown to be an interesting approach to such representation, and radically different approaches using Petri nets have been proposed. However, their relative strengths and weaknesses have not been examined. Moreover, their scalability and suitability for different tasks have not been addressed. This paper addresses both these challenges. First, we analyze existing Petri net representations in terms of their scalability and appropriateness for overhearing, an important task in monitoring open multi-agent systems. Then, building on the insights gained, we introduce a novel representation using Colored Petri nets that explicitly represent legal joint conversation states and messages. This representation approach offers significant improvements in scalability and is particularly suitable for overhearing. Furthermore, we show that this new representation offers a comprehensive coverage of all conversation features of FIPA conversation standards. We also present a procedure for transforming AUML conversation protocol diagrams (a standard human-readable representation), to our Colored Petri net representation.

          Related collections

          Most cited references5

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

          Stochastic context-free grammars for tRNA modeling.

          Stochastic context-free grammars (SCFGs) are applied to the problems of folding, aligning and modeling families of tRNA sequences. SCFGs capture the sequences' common primary and secondary structure and generalize the hidden Markov models (HMMs) used in related work on protein and DNA. Results show that after having been trained on as few as 20 tRNA sequences from only two tRNA subfamilies (mitochondrial and cytoplasmic), the model can discern general tRNA from similar-length RNA sequences of other kinds, can find secondary structure of new tRNA sequences, and can produce multiple alignments of large sets of tRNA sequences. Our results suggest potential improvements in the alignments of the D- and T-domains in some mitochondrial tRNAs that cannot be fit into the canonical secondary structure.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Efficient learning of context-free grammars from positive structural examples

              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Relating probabilistic grammars and automata

                Bookmark

                Author and article information

                Journal
                26 September 2011
                Article
                10.1613/jair.1829
                1109.5732
                55c7073d-33ba-4d72-b5a4-1956467029c0

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

                History
                Custom metadata
                Journal Of Artificial Intelligence Research, Volume 25, pages 349-387, 2006
                cs.AI
                jair.org

                Comments

                Comment on this article