Show simple item record  

dc.contributor.authorMalik, Robi
dc.contributor.authorFlordal, Hugo
dc.coverage.spatialConference held at Michigan, USAen_NZ
dc.date.accessioned2008-11-14T02:13:12Z
dc.date.available2008-11-14T02:13:12Z
dc.date.issued2006-07
dc.identifier.citationMalik, R. & Flordal, H. (2006). Modular nonblocking verification using conflict equivalence. In Discrete Event Systems, 8th International Workshop, 10-12 July 2006 (pp. 100-106).en_US
dc.identifier.urihttps://hdl.handle.net/10289/1338
dc.description.abstractThis paper proposes a modular approach to verifying whether a large discrete event system is nonconflicting. The new approach avoids computing the synchronous product of a large set of finite-state machines. Instead, the synchronous product is computed gradually, and intermediate results are simplified using conflict-preserving abstractions based on process-algebraic results about fair testing. Heuristics are used to choose between different possible abstractions. Experimental results show that the method is applicable to finite-state machine models of industrial scale and brings considerable improvements in performance over other methods.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherIEEEen_NZ
dc.rightsCopyright IEEE 2006en_US
dc.sourceWODES 2006en_NZ
dc.subjectcomputer scienceen_US
dc.titleModular nonblocking verification using conflict equivalenceen_US
dc.typeConference Contributionen_US
dc.identifier.doi10.1109/WODES.2006.1678415en_US
dc.relation.isPartOfProc 8th International Workshop on Discrete Event Systemsen_NZ
pubs.begin-page100en_NZ
pubs.elements-id16659
pubs.end-page106en_NZ
pubs.finish-date2006-07-12en_NZ
pubs.place-of-publicationUnited Statesen_NZ
pubs.start-date2006-07-10en_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record