Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Modeling and verifying a price model for congestion control in computer networks using promela/spin
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Symbolic Transition Graph with Assignment
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
Stability of multi-path dual congestion control algorithms
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
The Impact of Communication Models on Routing-Algorithm Convergence
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Interactions in Transport Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimisation-based overload control
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Lyapunov convergence for Lagrangian models of network control
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
| Hi-index | 0.00 |
Model checking has been widely applied to the verification of network protocols. Alternatively, optimisation based approaches have been proposed to reason about the large scale dynamics of networks, particularly with regard to congestion and rate control protocols such as TCP. This paper intends to provide a first bridge and explore synergies between these two approaches. We consider a series of discrete approximations to the optimisation based congestion control algorithms. Then we use branching time temporal logic to specify formally the convergence criteria for the system dynamics and present results from implementing these algorithms on a state-of-the-art model checker. We report on our experiences in using the abstraction of model checking to capture features of the continuous dynamics typical of optimisation based approaches.