Somsak Vanit-Anunchai

Learn More
The difference between this version and that published in LNCS concerns section 3.5 of the paper. After email discussions with Dr Kohler, one of the editors of DCCP, we agree that we overlooked the reference to initialising GAR to ISS when the variable was first defined in the declarations at the top of section 8.5 (Pseudocode) of DCCP version 11. Hence,(More)
The sweep-line state space method allows states to be deleted from memory during state exploration, thus alleviating state explosion. Properties of the system (such as the absence of deadlocks) can then be verified on-the-fly. This paper presents an extension to the sweep-line method that allows on-the-fly checking of language inclusion, which is useful for(More)
State space explosion is a key problem in the analysis of finite state systems. The sweep-line method is a state exploration method which uses a notion of progress to allow states to be deleted from memory when they are no longer required. This reduces the peak number of states that need to be stored, while still exploring the full state space. The(More)
This paper investigates the connection establishment procedures of the Datagram Congestion Control Protocol (DCCP) when sequence numbers wrap. A formal executable specification of DCCP connection management is obtained using Coloured Petri Nets. The model includes the synchronization procedure, sequence number wrapping and the algorithm for extending short(More)