The Use of Language Projection for Compositional Verification of Discrete Event Systems
Authors
Loading...
Permanent Link
Publisher link
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.
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.
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.
Series name
Date
Publisher
IEEE Computer Society