Can Decision Diagrams Overcome State Space Explosion in Real-Time Verification?

@inproceedings{Beyer2003CanDD,
  title={Can Decision Diagrams Overcome State Space Explosion in Real-Time Verification?},
  author={Dirk Beyer and Andreas Noack},
  booktitle={FORTE},
  year={2003}
}
In this paper we analyze the efficiency of binary decision diagrams (BDDs) and clock difference diagrams (CDDs) in the verification of timed automata. Therefore we present analytical and empirical complexity results for three communication protocols. The contributions of the analyses are: Firstly, they show that BDDs and CDDs of polynomial size exist for the reachability sets of the three protocols. This is the first evidence that CDDs can grow only polynomially for models with non-trivial… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS
14 Citations
24 References
Similar Papers

Similar Papers

Loading similar papers…