id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_stictr4ivbbi5b6acnnworse3y	Thorsten J. Ottosen	When to test? Troubleshooting with postponed system test	2011	25	.pdf	application/pdf	7115	1384	87	In this paper we investigate the most simple action-based troubleshooting scenario with a single extension: the overall system test is not The algorithm recursively generates all possible sequences of compound actions. Furthermore, we also give examples showing that none of the algorithms are guaranteed to find an optimal troubleshooting sequence. troubleshooting sequence and form compound actions by repeated application of Theorem 4. Algorithm 2 Computing sequence with compound actions greedily Unfortunately, Algorithm 5 is not guaranteed to find an optimal troubleshooting sequence, as the following example shows. Algorithm 4 Optimal Partition into Compound Actions Algorithm 8 Compound Action Sequence with Optimized Partition Algorithm 8 Compound Action Sequence with Optimized Partition the algorithm is not guaranteed to find optimal troubleshooting sequences. the algorithm is not guaranteed to find optimal troubleshooting sequences. Algorithm 5 and 8 find an optimal troubleshooting sequence in nonreorderable models. optimal sequence consists of only one compound action.	./cache/work_stictr4ivbbi5b6acnnworse3y.pdf	./txt/work_stictr4ivbbi5b6acnnworse3y.txt