Abstract
In analyzing in finite-state systems, it is often useful to define multiple-valued predicates. Such predicates can determine the (finite) levels of desirability of the current system state and transitions between them. We can capture multiple-valued predicates as elements of a logic defined over finite total orders (FTOs). In this paper we extend automata-theoretic LTL model-checking to reasoning about a class of multiple-valued logics. We also show that model-checking over FTOs is reducible to classical model-checking, and thus can be implemented in SPIN.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Barret, D. Dill, and K. Levitt. “Validity Checking for Combinations of Theories with Equality”. In Formal Methods in Computer-Aided Design, volume 1166 of LNCS, pages 187–201, November 1996.
G. Bruns and P. Godefroid. “Model Checking Partial State Spaces with 3-Valued Temporal Logics”. In Proceedings of CAV’99, volume 1633 of LNCS, pages 274–287, 1999.
G. Bruns and P. Godefroid. “Generalized Model Checking: Reasoning about Partial State Spaces”. In Proceedings of CONCUR’00, volume 877 of LNCS, pages 168–182, August 2000.
P. Cousot and R. Cousot. “Static Determination of Dynamic Properties of Generalized Type Unions”. SIGPLAN Notices, 12(3), March 1977.
M. Chechik and W. Ding. “Lightweight Reasoning about Program Correctness”. CSRG Technical Report 396, University of Toronto, March 2000.
M. Chechik, B. Devereux, and S. Easterbrook. “Implementing a Multi-Valued Symbolic Model-Checker”. In Proceedings of TACAS’01, April 2001.
M. Chechik, B. Devereux, S. Easterbrook, A. Lai, and V. Petrovykh. “Efficient Multiple-Valued Model-Checking Using Lattice Representations”. Submitted for publication, January 2001.
E.M. Clarke, O. Grumberg, and D.E. Long. “Model Checking and Abstraction”. IEEE Transactions on Programming Languages and Systems, 19(2), 1994.
M. Colon and T. Uribe. “Generating Finite-State Abstractions of Reactive Systems using Decision Procedures”. In Proceedings of the 10th Conference on Computer-Aided Verification, volume 1427 of LNCS. Springer-Verlag, July 1998.
S. Das, D. Dill, and S. Park. “Experience with Predicate Abstraction”. In Proceedings of the 11th International Conference on Computer-Aided Verification, volume 1633 of LNCS, pages 160–171. Springer-Verlag, 1999.
S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, New York, 1978.
W. Feller. An Introduction to Probability Theory and its Applications, volume I. John Wiley and Sons, New York, 1968.
M. Fitting. “Many-Valued Modal Logics”. Fundamenta Informaticae, 15(3-4):335–350, 1991.
M. Fitting. “Many-Valued Modal Logics II”. Fundamenta Informaticae, 17:55–73, 1992.
“Logical Foundations for Database Systems”. International Journal of Man-Machine Studies, 11(4):481–500, 1979.
M. Ginsberg. “Multi-valued logic”. In M. Ginsberg, editor, Readings in Nonmonotonic Reasoning, pages 251–255. Morgan-Kaufmann Pub., 1987.
J. S. Golan. Power Algebras over Semirings. Kluwer Academic, 1999.
R. Gerth, D. Peled, M. Vardi, and P. Wolper. “Simple On-the-fly Automatic Verification of Linear Temporal Logic”. In In Proceedings of 15th Workshop on Protocol Specification, Testing, and Verification, Warsaw, North-Holland, June 1995.
S. Graf and H. Saidi. “Construction of Abstract State Graphs with PVS”. In Proceedings of the 9th International Conference on Computer-Aided Verification, volume 1254 of LNCS. Springer-Verlag, 1997.
C. L. Heitmeyer, R. D. Jeffords, and B. G. Labaw. “Automated Consistency Checking of Requirements Specifications”. ACM Transactions on Software Engineering and Methodology, 5(3):231–261, July 1996.
R. Hähnle and W. Kernig. Verification of switch-level designs with many-valued logic. In International Conference LPAR’ 93, volume 698. Springer-Verlag, 1993.
J. He, K. Seidel, and A. McIver. Probabilistic models for the guarded command language. Science of Computer Programming, 28(2-3): 171–192, April 1997.
IEEE Standard 1164–1993. 1993.
“Variable-Valued Logic and its Applications to Pattern Recognition and Machine Learning”. In D. C. Rine, editor, Computer Science and Multiple-Valued Logic: Theory and Applications, pages 506–534. North-Holland, Amsterdam, 1977.
M. Sagiv, T. Reps, and R. Wilhelm. “Parametric Shape Analysis via 3-Valued Logic”. In Proceedings of 26th Annual ACM Symposium on Principles of Programming Languages, 1999.
H. Saidi and N. Shankar. “Abstract and Model Check while you Prove”. In Proceedings of the 11th Conference on Computer-Aided Verification, volume 1633 of LNCS, pages 443–454, July 1999.
W. Thomas. Automata on in finite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 4, pages 133–191. Elsevier Science Publishers B. V., 1990.
“Applying Predicate Abstraction to Model Check Object-Oriented Programs”. In Proceedings of 4th International Workshop on Formal Methods in Software Practice, August 2000.
M. Y. Vardi and P. Wolper. “An Automata-Theoretic Approach to Automatic Program Verification”. In Proceedings of 1st Symposium on Logic in Computer Science, pages 322–331, Cambridge MA, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chechik, M., Devereux, B., Gurfinkel, A. (2001). Model-checking in finite state-space systems with fine-grained abstractions using SPIN. In: Dwyer, M. (eds) Model Checking Software. SPIN 2001. Lecture Notes in Computer Science, vol 2057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45139-0_3
Download citation
DOI: https://doi.org/10.1007/3-540-45139-0_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42124-5
Online ISBN: 978-3-540-45139-6
eBook Packages: Springer Book Archive