Exam: Question 3 Flashcards

TAs & CTL

1
Q

What is a TA?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How does a TA work?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is CTL?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How do you describe the behaviour of a TA when it is in a particular state?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How do you find the time intervals and paths in and over which states are reachable?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is deadlock?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How do you find if a TA can deadlock?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is a TMR system?

A

triple modular redundant = !

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How do you formulate verbal properties in CTL for a given TA?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How do you formulate “possibly” verbal properties in CTL for a given TA?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

How do you formulate “invariantly” verbal properties in CTL for a given TA?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How do you formulate “it is possible that” verbal properties in CTL for a given TA?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How do you formulate “it is always possible that” verbal properties in CTL for a given TA?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

How do you formulate “always eventually x and before then y” verbal properties in CTL for a given TA?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What does weak until mean?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What does strong until mean?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

What is the difference between weak and strong until?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Define the weak until operator in CTL.

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Define the strong until operator in CTL.

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

How may you change a TA to stop it from deadlocking if it does so?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

How do you check for deadlocks in UPPAAL?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

How does the expressiveness of the logics CTL and LTL compare?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

How can you implement an if-else statement in a TA?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

How can you implement a while loop in a TA?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
How can you make TAs communicate synchronously?
!
26
How can you make TAs communicate asynchronously?
!
27
How can you make TAs communicate synchronously via channels that may deadlock without time constraints but can't with them?
!
28
Why may TAs that communicate synchronously via channels deadlock without time constraints but not with them?
!
29
How do you find the range of possible values of a variable in a state in a TA?
!
30
How do you state a CTL property that sets the maximum value of a variable?
!
31
How do you state a CTL property that sets the minimum value of a variable?
!
32
How do you state a CTL property that says it is possible to never reach a state?
!
33
How do you state a CTL property that says it is possible to reach a state?
!
34
How do you state a CTL property that says it is impossible to never reach a state?
!
35
How do you state a CTL property that says it is impossible to reach a state?
!
36
How do TAs communicate?
!
37
How do TAs exchange data?
!
38
How do you make a TA or TAs that implement a given verbally described system?
!
39
How do you add time constraints to TAs?
!
40
What is TCTL?
!
41
How can you formulate a safety property in TCTL?
!
42
How can you formulate a liveness property in TCTL?
!
43
How can you find whether a TA holds a TCTL property?
!
44
How do you describe what a given TA does?
!
45
How do you define a TA to do a specific function given the communications it performs, what it needs to do, how it should handle inbound data and the data types of inbound data.
!
46
What logic does UPPAAL use?
a restriction of TCTL
47
What are the restrictions on the version of TCTL that UPPAAL uses?
!
48
How do you formulate verbal properties in TCTL for a given TA?
!
49
How do you formulate "possibly" verbal properties in TCTL for a given TA?
!
50
How do you formulate "invariantly" verbal properties in TCTL for a given TA?
!
51
How do you formulate "it is possible that" verbal properties in TCTL for a given TA?
!
52
How do you formulate "it is always possible that" verbal properties in TCTL for a given TA?
!
53
How do you formulate "always eventually x and before then y" verbal properties in TCTL for a given TA?
!
54
How do you prove whether or not a CTL formula and LTL formula are equivalent?
!
55
How do you prove whether or not a TS satisfies a given CTL state formula?
!
56
How do you prove whether or not a TS satisfies given CTL state formula as the operands of until?
!
57
How do you prove whether or not a TS with outgoing transitions of states, for which either one of the operands is true or the other is false, satisfies given CTL state formula as the operands of until?
!
58
How do you prove whether or not a TA satisfies a given TCTL formula?
!
59
What kinds of systems can be modelled and verified with UPPAAL?
!
60
Describe a system made from three automata communicating synchronously via channels and such that without timing constraints it does not have a deadlock, but with certain timing constraints it does.
!
61
How can you find the overall purpose or function of a TA system?
!
62
How can you determine whether UPPAAL is suitable for testing a given system for a given problem?
!
63
How do you check for deadlocks in TCTL?
!
64
How can you describe the meaning of formulae?
!
65
How do you determine the satisfaction sets for a given CTL formula for a given TS?
!
66
How do you find whether TCTL formulae hold on TAs?
!
67
How do you find whether CTL formulae hold on TSes?
!