Fundamenta Informaticae - PETRI NETS 2007
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
The sweep-line state space exploration method
Theoretical Computer Science
Combining the sweep-line method with the use of an external-memory priority queue
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Fundamenta Informaticae - PETRI NETS 2007
Hybrid on-the-fly LTL model checking with the sweep-line method
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
A Sweep-Line Method for Büchi Automata-based Model Checking
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
Hi-index | 0.00 |
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 as sequences of actions of the modelled system. This has been implemented in a prototype sweep-line library for Coloured Petri nets. We evaluate the prototype by applying it to the connection management procedures of the Datagram Congestion Control Protocol, a new Internet transport protocol.