Abstract
An optimization technique is presented that compresses a chain of transitions into a single jump transition, thus making a model smaller prior to model checking. We give compression algorithms, together with conditions that allow such compressions to preserve next-time-free LTL. Experimental results are presented and discussed.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Marius Bozga, Jean-Claude Fernandez, and Lucian Ghirvu. State space reduction based on live variables analysis. In Static Analysis Symposium, pages 164–178, Venezia, Italy, 1999.
H. Van der Schoot and H. Ural. An improvement on partial order model checking with ample sets. Technical Report TR-96-11, Univ. of Ottawa, Canada, 1996.
E. W. Dijkstra. Guarded commands, nondeterminacy, and formal derivation of programs. Communications of ACM, 18(8):453–457, August 1975.
P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem. PhD thesis, University of Liége, Liége, Belgium, November 1994.
G. J. Holzmann. The engineering of a model checker: The gnu i-protocol case study revised. In 6th Workshop on SPIN, LNCS 1680, 1999.
ITU-T, Geneva. Functional Specification and Description Language (SDL), Recommendation Z.100, March 1993.
R. P. Kurshan, V. Levin, M. Minea, D. Peled, and H. Yenigün. Combining hardware and software verification tecniques. Formal Methods in System Design. accepted for publication.
R. P. Kurshan, V. Levin, and H. Yenigün. Compressing transitions for model checking. Technical report, Bell Labs, Lucent Technologies, 2002.
R. P. Kurshan. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, 1994.
R. P. Kurshan, V. Levin, M. Minea, D. Peled, and H. Yenigun. Static partial order reduction. In 4 th International Conference Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1384, pages 345–357, Portugal, 1998.
L. Lamport. What good is temporal logic? In R.E.A. Mason, editor, Information Processing, pages 657–668, Paris, September 1983. Elsevier Science Publishers.
V. Levin and H. Yenigun. SDLCheck: A model checking tool. In 13th CAV, France, 2001.
D. Peled. All from one, one for all-on model checking using representatives. In 5th CAV, LNCS 697, pages 409–423, Crete, June 1993. Springer-Verlag.
D. Peled, A. Valmari, and I. Kokkarinen. Relaxed visibility enhances partial order reduction. Formal Methods in System Design, 19(3), November 2001.
A. Pnueli. The temporal logics of programs. In 18th Annual IEEE-CS Symposium on Foundations of Computer Science, pages 46–57, Cambridge, 1977.
A. Valmari. A stubborn attack on state explosion. In 2nd CAV, LNCS 531, pages 156–165, Rutgers, June 1990. Springer-Verlag.
H. Yenigün. Static Partial Order Reduction and Model Checking of HW/SW Co-Design Systems. PhD thesis, Middle East Technical University, Turkey, 2000.
K. Yorav. Exploiting Syntactic Structure for Automatic Verification. PhD thesis, The Technion-Israel Institute of Technology, Haifa, Israel, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurshan, R., Levin, V., Yenigün, H. (2002). Compressing Transitions for Model Checking. In: Brinksma, E., Larsen, K.G. (eds) Computer Aided Verification. CAV 2002. Lecture Notes in Computer Science, vol 2404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45657-0_48
Download citation
DOI: https://doi.org/10.1007/3-540-45657-0_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43997-4
Online ISBN: 978-3-540-45657-5
eBook Packages: Springer Book Archive