Somsak Vanit-Anunchai

Learn More
A new protocol in the TCP/UDP family, the Datagram Congestion Control Protocol<lb>(DCCP), is designed to control congestion when considering delay sensitive applications.<lb>We believe it is useful to formally verify DCCP’s connection management procedures<lb>before they are implemented. We use Coloured Petri Nets (CPNs) to model these proce-<lb>dures. The(More)
A new protocol designed for real-time applications, the Datagram Congestion Control Protocol (DCCP), is specified informally in a final Internet Draft that has been approved as an RFC (Request For Comment). This paper analyses DCCP’s connection management procedures modelled using Coloured Petri Nets (CPNs). The protocol has been modelled at a sufficient(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)
The sweep-line state space method allows states to be deleted from memory during state exploration, thus alleviating the state explosion problem. 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 safety properties expressed(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 sweepline method that allows on-the-fly checking of language inclusion, which is useful for(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)