Blog
About

125
views
0
recommends
+1 Recommend
1 collections
    4
    shares
      • Record: found
      • Abstract: found
      • Conference Proceedings: found
      Is Open Access

      A Spanning Tree Object-Oriented Distributed Algorithm: Specification and Proof

      , , ,

      Proceedings of the Methods Integration Workshop (MI)

      Methods Integration Workshop

      25-26 March 1996

      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

          This paper presents a way to specify, to prove, and to implement object-oriented distributed cooperative algorithms. Our method gathers together three kinds of tools or formal concepts. It is derived from the B Method. So it uses a refinement approach and a proof of each specification step. The second set of concepts comes from distributed artificial intelligence. One main aspect of parallel and distributed computation is the uncertainty of the knowledge state of other sites. To express it, an epistemic logic is used to define knowledge of sites. Finally we consider some interesting practical results of distributed algorithms research. The method defines an application from three points of view (group, object, and method levels). A particular state automata formalism is used for each specification step. Finally, a distributed spanning tree algorithm i s developed.

          Related collections

          Most cited references 3

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

          The temporal logic of actions

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

            An axiomatic proof technique for parallel programs I

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

              A guide to completeness and complexity for modal logics of knowledge and belief

                Bookmark

                Author and article information

                Contributors
                Conference
                March 1996
                March 1996
                : 1-20
                Affiliations
                CNAM-Laboratoire CEDRIC

                292, Rue St Martin, FR-75141 Paris Cedex 03
                Article
                10.14236/ewic/MI1996.1
                © L. Bonnet et al. Published by BCS Learning and Development Ltd. Proceedings of the Methods Integration Workshop, Leeds

                This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

                Proceedings of the Methods Integration Workshop
                MI
                Leeds, UK
                25-26 March 1996
                Electronic Workshops in Computing (eWiC)
                Methods Integration Workshop
                Product
                Product Information: 1477-9358BCS Learning & Development
                Self URI (journal page): https://ewic.bcs.org/
                Categories
                Electronic Workshops in Computing

                Comments

                Comment on this article