Programming a fast explicit conflict checker

Malik, Robi

doi:10.1109/WODES.2016.7497885

Files

WODES 2016-2.pdf

Accepted version, 173.5Kb

DOI

10.1109/WODES.2016.7497885

Citation

Export citation

Malik, R. (2016). Programming a fast explicit conflict checker. In Proceeding of the 13th International Workshop on Discrete Event Systems (pp. 438–443). Xi’an China: IEEE. http://doi.org/10.1109/WODES.2016.7497885

Permanent Research Commons link: https://hdl.handle.net/10289/10503

Abstract

This paper describes the implementation of explicit model checking algorithms to verify the nonblocking or nonconflicting property of discrete event systems. Explicit algorithms enumerate and store all reachable states of a synchronous composition. Three alternatives optimised for memory consumption or runtime are described and compared. The algorithms have been implemented in C++ in the discrete event systems library Waters, and experimental results show that they can explore more than 100 million states on standard computers.

Date

2016

Type

Conference Contribution

Publisher

IEEE

Rights

This is an author’s accepted version of an article published in the Proceedings of the 13th International Workshop on Discrete Event Systems. ©2016 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 servers 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 [1447]