%&mbt
\begin{document}
+% 1
\section{Theory of Labelled Transition Systems}
+
+% 1.1
\subsection{Testing equivalences}
\begin{enumerate}[a)]
\item $\bordermatrix{
}$
\end{enumerate}
+% 1.2
\subsection{Testing equivalences}
\begin{enumerate}[a)]
\item $\bordermatrix{
}$
\end{enumerate}
+% 1.3
\subsection{Testing equivalences}
\begin{enumerate}[a)]
\item
\end{align*}
\end{enumerate}
+% 1.4
\subsection{Testing equivalences}
+\begin{enumerate}[a)]
+ \item $Q:=\xymatrix@C=1pc@R=1pc{
+ \ar[dr]\\
+ & *+[o][F-]{s_0}\ar@/_/[d]_a\\
+ & *+[o][F-]{s_1}\ar@/_/[u]_b\ar@/_/[d]_a\\
+ & *+[o][F-]{s_2}\ar@/_/[d]_a\ar@/_/[u]_b\\
+ & \ldots\ar@/_/[u]_b\\
+ }$
+ $P:=\xymatrix@C=1pc@R=1pc{
+ \ar[dr]\\
+ & *+[o][F-]{s_0}\ar@/_/[d]_a\ar[r]^\tau & *+[o][F-]{s_0}\ar@(r,u)[]_b\\
+ & *+[o][F-]{s_1}\ar@/_/[u]_b\ar@/_/[d]_a\ar@/_/[ur]_\tau\\
+ & *+[o][F-]{s_2}\ar@/_/[d]_a\ar@/_/[u]_b\ar@/_1pc/[uur]_\tau\\
+ & \ldots\ar@/_/[u]_b\ar@/_2pc/[uuur]_\tau\\
+ } $
+\end{enumerate}
+
+% 1.5
\subsection{Testing equivalences}
\end{document}
--- /dev/null
+Introduction
+===============================================================================
+Testing is:
+- Measure quality
+- Increase confidence
+- Help assess risks
+
+Challenges:
+- Big domains(infinite)
+- Never exhaustive
+- When to stop
+
+Activities:
+- Generation
+- Execution
+- Organization
+
+Quality
+Functionality, Reliability, Usability, Efficiency, Mainainability, Portability
+
+Types:
+- {Non, }Functional, functions or properties
+- Dimensionality
+ - Accessibility(black, grey, white box)
+ - Detail(system, integration, module, unit)
+ - Characteristics(functional, reliability, usability etc.)
+
+
+Black & White Box Testing
+===============================================================================
+Black box
+- Partitioning
+- Boundary value analysis
+- Error quessing(exploratory testing)
+
+White box
+- Coverage
+ - Path
+ - Statement
+ - Condition
+ - (multiple=all combinations of) Decicion
+
+Test Organization/TMap
+===============================================================================
+TMap: Test Management approach
+planning->preparation->generation->execution->completion
+
+v-model
+test incomplete things with
+- Driver: piece that simulates higher level system
+- Stub: piece that simulates lowel level
+
+[L]ife cycle
+- Strategy/planning
+ - Mission
+ - Strategy
+ - Approach
+ - Plan
+- Preparation
+ - Study test
+ - Specifications
+ - Testability
+ - System division
+- Generation
+ - Generation of cases:
+ - purpose, start, input, expected output
+ - Test infrastructure
+ - Implementation
+- Execution
+ - phase testing
+ - static
+ - pre-test
+ - full
+ - execution
+ - test
+ - repair
+ - retest
+ - discriminate in error
+ - implementation
+ - specification
+ - test case
+ - infrastructure
+ - report
+- Completion
+ - Report
+ - testware
+ - evaluation
+
+[T]echniques, [I]nfrastructure, [O]rganization
+
+More Black & White Box Testing
+===============================================================================
+Decision table: combination of input parameters
+Use case: test according to use cases
+Other whitebox: function, call, jump, dataflow, objectcode, loop, race
+
+Combinatorial Testing
+===============================================================================
+- Pairwise(triples, ...)
+- MC/DC. Modified condition/decision
+ Test only important, shown to independantly affect outcome
+
+ Thus if we have a && b && c we test:
+ 0 1 1 and 1 1 1
+
+Mutation Testing
+===============================================================================
+Make mutants, deliberate errors and see if the test catch it
+Add mutant, if not caught extend tests otherwise throw away mutant
+
+Quality and Reliability Challenges
+===============================================================================
+- Systems of systems pose a problem
+- Integration is a problem
+- Interface testing
+- Because of continous delivery regression testing
--- /dev/null
+FSM-based testing
+===============================================================================
+FSM: States, transitions, inputs, outputs
+(S, s0, I, O, delta, lambda)
+(States, initial, inputs, outputs, transition function, output function)
+
+- Deterministic, complete, connected, reduced
+- Tests length k only prove models with k extra states(k-complete)
+- With resets
+- W method
+ - we test a state by testing that after reaching it the input/output is
+ good
+- Transition tour, one loop all transitions
+- Synchonizing, get always to a fixed state
+
+- Compare with LTS:
+ - has to be deterministic and complete
+ - Only i/o alternation
+ - not compositional
+ - more intuitive
+ - older theory
+
+MBT with LTS 1
+===============================================================================
+
+MBT with LTS 2
+===============================================================================
+
+MBT with LTS 3
+===============================================================================
+
+MBT with LTS 4
+===============================================================================
+
+
+MBT with GAST
+===============================================================================
+Functional, black box, cycle detection, automatic generation, quickcheck,
+quantification
+- Property
+- Model
+
+MBT with SpecExplorer
+===============================================================================