Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      The Use of Language Projection for Compositional Verification of Discrete Event Systems

      Ware, Simon; Malik, Robi
      Thumbnail
      Files
      wodes2008projection.pdf
      125.4Kb
      DOI
       10.1109/WODES.2008.4605966
      Link
       ieeexplore.ieee.org
      Find in your library  
      Citation
      Export citation
      Ware, S. & Malik, R.(2008). The use of language projection for compositional verification of discrete event systems. In B. Lennartson, M. Fabian, K. Åkesson, A. Giua, R. Kumar (Eds), Proceedings of 9th International Workshop on Discrete Event Systems (WODES'08). IEEE, Göteborg, Sweden; 28-30 May, 2008(pp.322-327). Washington, DC, USA: IEEE Computer Society.
      Permanent Research Commons link: https://hdl.handle.net/10289/1786
      Abstract
      This paper proposes the use of abstraction by language projection to improve the performance of compositional verification to prove or disprove that a large system of composed finite-state machines satisfies a given safety property. Algorithms are presented for the automatic verification of language inclusion and controllability for discrete event systems, and are applied to a set realistic industrial examples. The experimental results suggest that the method can improve performance considerably, particularly in cases where previous methods of compositional verification fail because a large number of automata need to be considered.
      Date
      2008
      Type
      Conference Contribution
      Publisher
      IEEE Computer Society
      Rights
      This article has been published in the Proceedings of 9th International Workshop on Discrete Event Systems (WODES'08). IEEE, Göteborg, Sweden; 28-30 May, 2008. ©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to severs or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
      Collections
      • Computing and Mathematical Sciences Papers [1454]
      Show full item record  

      Usage

      Downloads, last 12 months
      75
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement