By Topic

The Use of language projection for compositional verification of discrete event systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ware, S. ; Dept. of Comput. Sci., UniversityUniversity Univ. of Waikato, Hamilton ; Malik, R.

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.

Published in:

Discrete Event Systems, 2008. WODES 2008. 9th International Workshop on

Date of Conference:

28-30 May 2008