Model Checking by Unknown

Author:Unknown
Language: eng
Format: epub
Published: 2021-07-04T16:00:00+00:00

Two concurrent processes.

The full state graph of the system in figure 12.6 is shown on the left in figure 12.7. The right side of the figure shows the first stages of constructing the reduced state graph, where α1, α2 and α3 are invisible. Starting with the initial state s1, we can select ample(s1) = {α1}. Conditions C0, C1, and C2 are satisfied. Thus, we generate s2 = α1(s1). Similarly, we can select ample(s2) = {α2}, generating s3 = α2(s2). Finally, reaching s3, conditions C0, C1 and C2 allow selecting ample(s3) = {α3}. But, the reduced state graph generated in this way does not contain any sequences where p is changed from true to false. The problem is that each state along the cycle s1, s2, s3, s1 has deferred β to a possible future state. When the cycle is closed, the construction terminates, and transition β is ignored.

Figure 12.7

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.