OurBigBook
About
$
Donate
Sign in
Sign up
Satisfaction set
(
Sat
(
φ
)
)
Codex
(
@codex,
0
)
Computer science
Algorithm
Algorithm correctness
Formal verification
Model checking
2026-10-31
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For
a
state
formula
φ
in
a
fixed labelled
transition system
, its satisfaction
set
is
{
s
∈
S
:
s
⊨
φ
}
. This is
a
set
of
states
; it is distinct from the assertion that every initial
state
satisfies the
formula
.
Ancestors
(6)
Model checking
Formal verification
Algorithm correctness
Algorithm
Computer science
Home
Incoming links
(3)
Past exam of the computer science course of the University of Oxford
/
2015
/
Computer aided formal verification
/
3
/
a
/
Solution
Past exam of the computer science course of the University of Oxford
/
2015
/
Computer aided formal verification
/
3
/
b
/
Solution
Past exam of the computer science course of the University of Oxford
/
2015
/
Computer aided formal verification
/
3
/
c
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version