-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathintro_formalsynthrobo_exercises.tex
60 lines (48 loc) · 2.02 KB
/
intro_formalsynthrobo_exercises.tex
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
\documentclass{amsart}
\usepackage{hyperref}
\usepackage{fmrtexcommon}
\DeclareMathOperator{\Inf}{Inf}
\DeclareMathOperator{\Act}{Act}
\DeclareMathOperator{\ap}{AP}
\DeclareMathOperator{\true}{\mathtt{true}}
\DeclareMathOperator{\false}{\mathtt{false}}
\theoremstyle{definition}
\newtheorem{exer}{Exercise}
\begin{document}
\title{Introduction to Formal Methods in Robotics:\linebreak exercises}
\author{Scott C. Livingston}
\thanks{\textit{Email}: \href{mailto:[email protected]}{[email protected]}}
\date{\textbf{draft}; built \now}
\begin{abstract}
We present a collection of exercises that supplements the Introduction
\cite{ifmr2014}. It should be possible to perform these without consulting
outside resources.
\end{abstract}
\maketitle
\begin{exer}
In Definition~1 we assumed that $\delta$ is not a partial function. Why is this
without loss of generality? ($f:A\rightarrow B$ is said to be a \textit{partial
function} if there may be elements of $A$ for which $f$ is not defined.)
\end{exer}
\begin{exer}
Show that labeling in terms of a finite set of atomic propositions is equivalent
to labeling with variables that take values from finite domains.
(Cf.\ Section~5.)
%% By ``equivalence,'' we mean that for any transition system $T_1$ with labels
%% that are value assignments to a finite collection of variables, there is a
%% transition system $T_2$ with labels that are subsets of a set of atomic
%% propositions such that any property for $T_1$ can be
\end{exer}
\begin{exer}
Let $p$ and $q$ be atomic propositions. Prove that $\Galways p \wedge \Galways q \equiv \Galways \left( p \wedge q \right)$. (Hint: Ignore details concerning the system exhibiting labels, and instead reason about infinite strings.)
\end{exer}
\begin{exer}
Construct two transition systems such that one simulates the other, but not the converse.
\end{exer}
\begin{exer}
Construct a parity game with two vertices in which exactly one vertex is winning
(for Player~0).
\end{exer}
\bibliographystyle{abbrv}
\bibliography{intro}
\end{document}