Loading in 5 sec....

Probabilistic Verification of Discrete Event Systems using Acceptance SamplingPowerPoint Presentation

Probabilistic Verification of Discrete Event Systems using Acceptance Sampling

Download Presentation

Probabilistic Verification of Discrete Event Systems using Acceptance Sampling

Loading in 2 Seconds...

- 128 Views
- Uploaded on
- Presentation posted in: General

Probabilistic Verification of Discrete Event Systems using Acceptance Sampling

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Probabilistic Verification of Discrete Event Systems using Acceptance Sampling

- Verify properties of discrete event systems
- Model independent approach
- Probabilistic real-time properties expressed using CSL
- Acceptance sampling
- Guaranteed error bounds

- Triple modular redundant system
- Three processors
- Single majority voter

Voter

CPU 1

CPU 2

CPU 3

3 CPUs upvoter up

Voter

CPU 1

CPU 2

CPU 3

CPU fails

3 CPUs upvoter up

2 CPUs upvoter up

40

Voter

CPU 1

CPU 2

CPU 3

CPU fails

repair CPU

3 CPUs upvoter up

2 CPUs upvoter up

2 CPUs up

repairing CPU

voter up

40

19.2

Voter

CPU 1

CPU 2

CPU 3

CPU fails

repair CPU

CPU fails

3 CPUs upvoter up

2 CPUs upvoter up

2 CPUs up

repairing CPU

voter up

1 CPU uprepairing CPU

voter up

40

19.2

11

Voter

CPU 1

CPU 2

CPU 3

CPU fails

repair CPU

CPU fails

CPU repaired

3 CPUs upvoter up

2 CPUs upvoter up

2 CPUs up

repairing CPU

voter up

1 CPU uprepairing CPU

voter up

2 CPUs upvoter up

40

19.2

11

4

…

Voter

CPU 1

CPU 2

CPU 3

CPU fails

repair CPU

CPU fails

CPU repaired

3 CPUs upvoter up

2 CPUs upvoter up

2 CPUs up

repairing CPU

voter up

1 CPU uprepairing CPU

voter up

2 CPUs upvoter up

40

19.2

11

4

…

CPU fails

repair CPU

CPU repaired

voter fails

3 CPUs upvoter up

2 CPUs upvoter up

2 CPUs up

repairing CPU

voter up

3 CPUs up

voter up

3 CPUs upvoter down

82

13

16

4

…

- Probabilistic real-time properties
- “The probability is at least 0.1 that the voter fails within 120 time units while at least 2 CPUs have continuously remained up”

- Probabilisticreal-time properties
- “The probability is at least 0.1 that the voter fails within 120 time units while at least 2 CPUs have continuously remained up”

CSL formula:

Pr≥0.1(“2 CPUs up” “3 CPUs up” U≤120 “voter down”)

- State formulas
- Truth value is determined in a single state

- Path formulas
- Truth value is determined over an execution path

- Standard logic operators: ¬, 1 2 …
- Probabilistic operator: Pr≥()
- True iff probability is at least that holds

- Until: 1 U≤t2
- Holds iff 2 becomes true in some state along the execution path before time t, and 1 is true in all prior states

- “2 CPUs up” “3 CPUs up” U≤120 “voter down”

CPU fails

repair CPU

CPU fails

CPU repaired

3 CPUs upvoter up

2 CPUs upvoter up

2 CPUs up

repairing CPU

voter up

1 CPU uprepairing CPU

voter up

2 CPUs upvoter up

40

19.2

11

4

…

False!

+

+

+

≤ 120

- “2 CPUs up” “3 CPUs up” U≤120 “voter down”

CPU fails

repair CPU

CPU repaired

voter fails

3 CPUs upvoter up

2 CPUs upvoter up

2 CPUs up

repairing CPU

voter up

3 CPUs up

voter up

3 CPUs upvoter down

82

13

16

4

…

True!

- “The probability is at least 0.1 that ”
- Symbolic Methods
- Pro: Exact solution
- Con: Works only for restricted class of systems

- Sampling
- Pro: Works for any system that can be simulated
- Con: Uncertainty in correctness of solution

- Symbolic Methods

- Use simulation to generate sample execution paths
- Use sequential acceptance sampling to verify probabilistic properties

- Probability of false negative: ≤
- We say that is false when it is true

- Probability of false positive: ≤
- We say that is true when it is false

- Hypothesis: Pr≥()

1 –

Probability of acceptingPr≥() as true

Actual probability of holding

1 –

False negatives

Probability of acceptingPr≥() as true

False positives

Actual probability of holding

1 –

False negatives

Probability of acceptingPr≥() as true

Indifference region

–

+

False positives

Actual probability of holding

True, false,or anothersample?

- Hypothesis: Pr≥()

Number ofpositive samples

Number of samples

Accept

Number ofpositive samples

Continue sampling

Reject

Number of samples

- We can find an acceptance line and a rejection line given , , , and

A,,,(n)

R,,,(n)

Accept

Number ofpositive samples

Continue sampling

Reject

Number of samples

- Reject hypothesis

Accept

Number ofpositive samples

Continue sampling

Reject

Number of samples

- Accept hypothesis

- Verify Pr≥() with error bounds and
- Generate sample execution paths using simulation
- Verify over each sample execution path
- If is true, then we have a positive sample
- If is false, then we have a negative sample

- Use sequential acceptance sampling to test the hypothesis Pr≥()

- Suppose , in Pr≥(), contains probabilistic statements
- Error bounds ’ and ’ when verifying

True, false,or anothersample?

- Suppose , in Pr≥(), contains probabilistic statements

Accept

With ’ and ’ = 0

Number ofpositive samples

Continue sampling

Reject

Number of samples

- Find an acceptance line and a rejection line given , , , , ’, and ’:

A,,,(n)

R,,,(n)

With ’ and ’ > 0

Number ofpositive samples

Number of samples

- Find an acceptance line and a rejection line given , , , , ’, and ’:

Accept

Continue sampling

Reject

Number ofpositive samples

Number of samples

- Find an acceptance line and a rejection line given , , , , ’, and ’:

A’,’,,(n)

Accept

’ – ’= 1 – (1 – ( – ))(1 – ’)

’ + ’= ( + )(1 – ’)

Continue sampling

R’,’,,(n)

Reject

- To verify ¬ with error bounds and
- Verify with error bounds and

- Verify 12 … n with error bounds and
- Verify each i with error bounds and /n

- To verify 1 U≤t2 with error bounds and
- Convert to disjunction
- 1 U≤t2 holds if 2 holds in the first state, or if 2 holds in the second state and 1holds in all prior states, or …

- Convert to disjunction

- Given 1 U≤t2, let n be the index of the first state more than t time units away from the current state
- Disjunction of n conjunctions c1 through cn, each of size i
- Simplifies if 1 or 2, or both, do not contain any probabilistic statements

= 0.01

= 0.9

Average number of samples

= = 10-10

= = 10-1

Actual probability of holding

= = 10-2

= 0.9

=0.001

=0.002

Average number of samples

=0.005

=0.01

=0.02

=0.05

Actual probability of holding

- Model independent probabilistic verification of discrete event systems
- Sample execution paths generated using simulation
- Probabilistic properties verified using sequential acceptance sampling
- Easy to trade accuracy for efficiency

- Develop heuristics for formula ordering and parameter selection
- Use in combination with symbolic methods
- Apply to hybrid dynamic systems
- Use verification to aid controller synthesis for discrete event systems

http://www.cs.cmu.edu/~lorens/prover.html