Lecture Notes in Computer Science 3472

Literature 649
[TPvB97] Q. M. Tan, A. Petrenko, and Gregor v. Bochmann. Checking experiments
with labeled transition systems for trace equivalence. In Proceedings of the
10th International Workshop on Testing Communicating Systems (IWTCS
1997), 1997. [160, 161, 162, 163]
[Tra02] Avraham N. Trakhtman. The existence of synchronizing word and čern´y
conjecture for some finite automata. In Proceedings of the 2nd Haifa Workshop
on Graph Theory, Combinatorics and Algorithms (GTCA 2002), June
2002. [31]
[Tre94] Jan Tretmans. A formal approach to conformance testing. In Proceedings of
the 6th IFIP TC6/WG6.1 International Workshop on Protocol Test Systems
(IWPTS 1993), volumeC-19ofIFIP Transactions, pages 257–276. North-
Holland, 1994. [119, 145, 146]
[Tre96a] J. Tretmans. Conformance testing with labelled transisition systems: Implementation
relations and test generation. Computer Networks and ISDN
Systems, 29:49–79, 1996. [417, 424]
[Tre96b] J. Tretmans. Test generation with inputs, outputs, and quiescence. In
T. Margaria and B. Steffen, editors, Proceedings of the 2nd International
Workshop on Tools and Algorithms for the Construction and Analysis of
Systems (TACAS 1996), volume 1055 of Lecture Notes in Computer Science,
pages 127–146. Springer-Verlag, 1996. [173, 179, 184, 185, 187, 194]
[Tre96c] J. Tretmans. Test Generation with Inputs, Outputs and Repetitive Quiescence.
Software – Concepts and Tools, 17(3):103–120, 1996. [175, 178, 417,
420, 421, 424]
[U2T] U2TP Consortium. http://www.fokus.fraunhofer.de/u2tp/. [497]
[U2T04] U2TP Consortium. UML Testing Profile, March 2004. Final Adopted Specification
at OMG (ptc/2004-04-02). [497, 498]
[UMLa] UML 2.0. http://www.omg.org/uml. [497]
[UMLb] UMLAUT website. http://www.irisa.fr/UMLAUT/. [419, 420]
[UML03a] UML 2.0 Infrastructure Specification, November 2003. OMG Adopted Specification
(ptc/03-09-15). [497]
[UML03b] UML 2.0 Superstructure, September 2003. OMG Adopted Specification
(ptc/03-08-02). [497]
[UWZ97] Hasan Ural, Xiaolin Wu, and Fan Zhang. On minimizing the lengths of
checking sequences. IEEE Transactions on Computers, 46(1):93–99, 1997.
[104]
[Vaa91] F. Vaandrager. On the relationship between process algebra and Input/Output
Automata. In Proceeedings on the 6th IEEE Symposium on Logic in
Computer Science (LICS 1991), pages 387–398. IEEE Computer Society
Press, 1991. [181]
[Val84] L. G. Valiant. A theory of the learnable. Communications of the ACM,
27(11):1134–1142, 1984. [307]
[Var96] M. Y. Vardi. An automata-theoretic approach to linear temporal logic.
In F. Moller and G. M. Birtwistle, editors, Logics for Concurrency – Structure
versus Automata. Proceedings of the 8th Banff Higher Order Workshop
(Banff 1995), volume 1043 of Lecture Notes in Computer Science, pages
238–266. Springer-Verlag, 1996. [566, 567]
[Var01] M. Y. Vardi. Branching vs. linear time: Final showdown. In W. Yi T. Margaria,
editor, Proceedings of the 7th International Conference on Tools and
Algorithms for the Construction and Analysis of Systems (TACAS 2001),
volume 2031 of Lecture Notes in Computer Science, pages 1–22. Springer-
Verlag, January 2001. [562]