To store or not to store

39Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

To limit the explosion problem encountered during reachability analysis we suggest a variety of techniques for reducing the number of states to be stored during exploration, while maintaining the guarantee of termination and keeping the number of revisits small. The techniques include static analysis methods for component automata in order to determine small sets of covering transitions. We carry out extensive experimental investigation of the techniques within the real-time verification tool UPPAAL. Our experimental results are extremely encouraging: a best combination is identified which for a variety of industrial case-studies reduces the space-consumption to less than 10% with only a moderate overhead in time-performance. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Behrmann, G., Larsen, K. G., & Pelánek, R. (2003). To store or not to store. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2725, 433–445. https://doi.org/10.1007/978-3-540-45069-6_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free