Formal verification of mutual exclusion between the guards of deterministic choice structures

M. Boubekeur*, K. L. Man, M. P. Schellekens

*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceedingConference Proceedingpeer-review

Abstract

The formal verification of mutual exclusion between the guards of a deterministic choice structure is of great interest to the asynchronous circuit designers. To perform this spot of checking, we propose a treatment in two phases; the first is based on a static analysis, the Mutual Exclusion (ME) is checked using a symbolic decision tool. In the second phase, if the static analysis returns a result like "the model does not satisfy mutual exclusion", the dynamic verification takes into account the constraints of the environment to refine the analysis. If the mutual exclusion is still not satisfied, it gives a counter-example. The principle is to check wether indeterminism exists during the construction of the whole execution model, using a model-checking tool.

Original languageEnglish
Title of host publication2007 Canadian Conference on Electrical and Computer Engineering, CCECD
Pages1417-1420
Number of pages4
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event2007 Canadian Conference on Electrical and Computer Engineering, CCECD - Vancouver, BC, Canada
Duration: 22 Apr 200726 Apr 2007

Publication series

NameCanadian Conference on Electrical and Computer Engineering
ISSN (Print)0840-7789

Conference

Conference2007 Canadian Conference on Electrical and Computer Engineering, CCECD
Country/TerritoryCanada
CityVancouver, BC
Period22/04/0726/04/07

Cite this