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

      Relaxing Property Preservation in the Refinement of Concurrent Systems

      Proceedings of the 2nd BCS-FACS Northern Formal Methods (FM)

      Northern Formal Methods

      14-15 July 1997

      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

          One of the major development strategies for concurrent systems suggests to start the system development from a socalled functional design of the envisaged system and to distribute/parallelize this design in subsequent development steps towards a concurrent system.

          In this paper we argue that this strategy is not supported by the standard state-based refinement approaches. This phenomenon is traced back to the fact that these approaches are constructed such that necessarily all temporal properties of the refined system are preserved during refinement.

          We explain that the key feature of a suitable refinement notion for the above strategy has to relax this strict preservation of properties. Rather than preserving all temporal properties of the refined system the required refinement notion has to support the exclusive preservation of specific properties. We present such a refinement approach and prove that the standard state-based refinement relations are particular instances of the advocated notion.

          Related collections

          Most cited references 7

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

          The existence of refinement mappings

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

            Program development by stepwise refinement

             Niklaus Wirth (1971)
              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Hierarchical correctness proofs for distributed algorithms

                Bookmark

                Author and article information

                Contributors
                Conference
                July 1997
                July 1997
                : 1-15
                Affiliations
                Weizmann Institute of Science

                Rehovot, Israel
                Article
                10.14236/ewic/FA1997.16
                © Michael Siegel. Published by BCS Learning and Development Ltd. Proceedings of the 2nd BCS-FACS Northern Formal Methods Workshop, Ilkley

                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 2nd BCS-FACS Northern Formal Methods
                FM
                2
                Ilkley
                14-15 July 1997
                Electronic Workshops in Computing (eWiC)
                Northern Formal Methods
                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