-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathatomicproposition.go
118 lines (94 loc) · 2.47 KB
/
atomicproposition.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
/*
atomicproposition.go
Description:
Basic implementation of an Atomic Proposition object.
*/
package modelchecking
import (
"errors"
combinations "github.com/mxschmitt/golang-combinations"
)
type AtomicProposition struct {
Name string
}
/*
Equals
Description:
Compares the atomic propositions by their names.
*/
func (ap AtomicProposition) Equals(ap2 AtomicProposition) bool {
return ap.Name == ap2.Name
}
/*
StringSliceToAPs
Description:
Transforms a slice of int variables into a list of AtomicPropositions
*/
func StringSliceToAPs(stringSlice []string) []AtomicProposition {
var APList []AtomicProposition
for _, apName := range stringSlice {
APList = append(APList, AtomicProposition{Name: apName})
}
return APList
}
/*
In
Description:
Determines if the Atomic Proposition is in a slice of atomic propositions.
*/
func (ap AtomicProposition) In(apSliceIn []AtomicProposition) bool {
for _, tempAP := range apSliceIn {
if ap.Equals(tempAP) {
return true
}
}
return false
}
/*
ToSliceOfAtomicPropositions
Description:
Attempts to convert an arbitrary slice into a slice of atomic propositions.
*/
func ToSliceOfAtomicPropositions(slice1 interface{}) ([]AtomicProposition, error) {
// Attempt To Cast
castedSlice1, ok1 := slice1.([]AtomicProposition)
if ok1 {
return castedSlice1, nil
} else {
return []AtomicProposition{}, errors.New("There was an issue casting the slice into a slice of Atomic Propositions.")
}
}
/*
Powerset
Description:
Creates all possible subsets of the input array of atomic propositions.
*/
func Powerset(setOfAPs []AtomicProposition) [][]AtomicProposition {
var AllCombinations [][]AtomicProposition
var AllCombinationsAsStrings [][]string
var AllNames []string
for _, ap := range setOfAPs {
AllNames = append(AllNames, ap.Name)
}
AllCombinationsAsStrings = combinations.All(AllNames)
for _, tempStringSlice := range AllCombinationsAsStrings {
AllCombinations = append(AllCombinations, StringSliceToAPs(tempStringSlice))
}
AllCombinations = append(AllCombinations, []AtomicProposition{})
return AllCombinations
}
/*
SatisfactionHelper
Description:
Identifies if the state stateIn satisfies the atomic proposition ap.
*/
func (ap AtomicProposition) SatisfactionHelper(stateIn TransitionSystemState) (bool, error) {
// Constants
SystemPointer := stateIn.System
LOfState := SystemPointer.L[stateIn]
// Find If ap is in LOfState
return ap.In(LOfState), nil
}
func (ap AtomicProposition) String() string {
return ap.Name
}