"The topology of a network (such as a telecommunications, multiprocessor, or local area network, to name just a few) is usually modelled by a graph in which vertices represent 'nodes' (stations or processors) while undirected or directed edges stand for 'links' or other types of connections, physical or virtual. A cycle that contains every vertex of a graph is called a hamiltonian cycle and a graph which contains a hamiltonian cycle is called a hamiltonian graph. The problem of the existence of a hamiltonian cycle is closely related to the well known problem of a travelling salesman. These problems are NP-complete and NP-hard, respectively. While some necessary and sufficient conditions are known, to date, no practical characterization of hamiltonian graphs has been found. There are several ways to generalize the notion of a hamiltonian cycle. In this thesis we make original contributions in two of them, namely k-walks and r-trestles." --Abstract. / Doctor of Philosophy

Using the approach of Coloured Petri nets (CPNs) and automata theory, this thesis shows how to formalise the service provided by the Transmission Control Protocol (TCP) and verify TCP Connection Management, an essential part of TCP. Most of the previous work on modelling and analysing TCP Connection Management is based on early versions of TCP, which are different from the current TCP specification. Also the scope is mainly confined to the connection establishment procedure, while the release procedure is either simplified or omitted from investigation. This thesis extends prior work by verifying a detailed model of TCP Connection Management. In defining the TCP service, the set of service primitives and their sequencing constraints are specified at each service access point. / thesis (PhDComputerSystemsEng)--University of South Australia, 2004.

Thesis (M.S.)--Rochester Institute of Technology, (1989). / Includes bibliographical references (leaves 170-171).

Thesis (M.S.)--University of Nevada, Reno, 2005. / "May 2005." Includes bibliographical references (leaves 53-54). Online version available on the World Wide Web.

Thesis (M.Sc.) - Carleton University, 2002. / Includes bibliographical references (p. 85-87). Also available in electronic format on the Internet.

Thesis (Ph. D.)--University of Hong Kong, 2008. / Includes bibliographical references (leaf 180-190) Also available in print.

Thesis (Ph.D.). / Written for the Dept. of Electrical & Computer Engineering. Title from title page of PDF (viewed 2009/06/11). Includes bibliographical references.

Thesis (doctoral)--Technische Universiteit Delft, 1998. / Includes bibliographical references (p. 145-151).

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 63-66). Also available in electronic version. Access restricted to campus users.

Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 163-171). Also available in electronic version. Access restricted to campus users.