Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

CS4052 Logic and Software Verification > Exam: Question 3 > Flashcards

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
Q

How can you make TAs communicate synchronously?

A

!

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

How can you make TAs communicate asynchronously?

A

!

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

How can you make TAs communicate synchronously via channels that may deadlock without time constraints but can’t with them?

A

!

28
Q

Why may TAs that communicate synchronously via channels deadlock without time constraints but not with them?

A

!

29
Q

How do you find the range of possible values of a variable in a state in a TA?

A

!

30
Q

How do you state a CTL property that sets the maximum value of a variable?

A

!

31
Q

How do you state a CTL property that sets the minimum value of a variable?

A

!

32
Q

How do you state a CTL property that says it is possible to never reach a state?

A

!

33
Q

How do you state a CTL property that says it is possible to reach a state?

A

!

34
Q

How do you state a CTL property that says it is impossible to never reach a state?

A

!

35
Q

How do you state a CTL property that says it is impossible to reach a state?

A

!

36
Q

How do TAs communicate?

A

!

37
Q

How do TAs exchange data?

A

!

38
Q

How do you make a TA or TAs that implement a given verbally described system?

A

!

39
Q

How do you add time constraints to TAs?

A

!

40
Q

What is TCTL?

A

!

41
Q

How can you formulate a safety property in TCTL?

A

!

42
Q

How can you formulate a liveness property in TCTL?

A

!

43
Q

How can you find whether a TA holds a TCTL property?

A

!

44
Q

How do you describe what a given TA does?

A

!

45
Q

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.

A

!

46
Q

What logic does UPPAAL use?

A

a restriction of TCTL

47
Q

What are the restrictions on the version of TCTL that UPPAAL uses?

A

!

48
Q

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

A

!

49
Q

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

A

!

50
Q

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

A

!

51
Q

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

A

!

52
Q

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

A

!

53
Q

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

A

!

54
Q

How do you prove whether or not a CTL formula and LTL formula are equivalent?

A

!

55
Q

How do you prove whether or not a TS satisfies a given CTL state formula?

A

!

56
Q

How do you prove whether or not a TS satisfies given CTL state formula as the operands of until?

A

!

57
Q

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?

A

!

58
Q

How do you prove whether or not a TA satisfies a given TCTL formula?

A

!

59
Q

What kinds of systems can be modelled and verified with UPPAAL?

A

!

60
Q

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.

A

!

61
Q

How can you find the overall purpose or function of a TA system?

A

!

62
Q

How can you determine whether UPPAAL is suitable for testing a given system for a given problem?

A

!

63
Q

How do you check for deadlocks in TCTL?

A

!

64
Q

How can you describe the meaning of formulae?

A

!

65
Q

How do you determine the satisfaction sets for a given CTL formula for a given TS?

A

!

66
Q

How do you find whether TCTL formulae hold on TAs?

A

!

67
Q

How do you find whether CTL formulae hold on TSes?

A

!

CS4052 Logic and Software Verification (17 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions