Dealing with the complexity of state space exploration algorithms for SDL systems

Jens Grabowski, Rudolf Scheurer, Daniel Toggweiler, Dieter Hogrefe

Abstract

The treatment of complexity is one of the main problems in the area of validation and verification of formally specified protocols. The problem can be tackled by using <em>heuristics</em>, <em>partial order simulation methods</em>, and <em>optimization strategies</em>. We present these mechanisms and describe the way they work. Their usefulness will be discussed by presenting the results of some experiments.
Document Type: 
Articles in Conference Proceedings
Booktitle: 
Proceedings of the 6th GI/ITG Technical Meeting on Formal Description Techniques for Distributed Systems
Volume: 
20
Number: 
9
Month: 
5
Year: 
1996
2024 © Software Engineering For Distributed Systems Group

Main menu 2