Abstract
Multiple-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. We specify multiple-valued logics using finite lattices. In this paper, we use lattice representation theory to cast the multiple-valued modelchecking problem in terms of symbolic operations on classical sets of states, provided the lattices are distributive. This allows us to partially reuse existing symbolic model-checking technology and improve efficiency over previous implementations that were based on multiple-valued decision diagrams.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N.D. Belnap. “A Useful Four-Valued Logic”. In Dunn and Epstein, editors, Modern Uses of Multiple-Valued Logic, pages 30–56. Reidel, 1977.
L. Bolc and P. Borowik. Many-Valued Logics. Springer-Verlag, 1992.
G. Bruns and P. Godefroid. “Model Checking Partial State Spaces with 3-Valued Temporal Logics”. In Proceedings ofCAV’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.
R. E. Bryant. “Symbolic Boolean manipulation with ordered binary-decision diagrams”. Computing Surveys, 24(3):293–318, September 1992.
T. Bultan, R. Gerber, and C. League. “Composite Model Checking: Verification with Type-Specific Symbolic Representations”. ACM Transactions on Software Engineering and Methodology, 9(1):3–50, January 2000.
M. Chechik, B. Devereux, and S. Easterbrook. “Implementing a Multi-Valued Symbolic Model-Checker”. In Proceedings of TACAS’01, volume 2031 of LNCS, pages 404–419. Springer, April 2001.
M. Chechik, B. Devereux, and A. Gurfinkel. “Model-Checking Infinite State-Space Systems with Fine-Grained Abstractions Using SPIN”. In Proceedings of the 8th SPIN Workshop on Model Checking Software, volume 2057 of LNCS, pages 16–36, May 2001.
M. Chechik and W. Ding. “Lightweight Reasoning about Program Correctness”. CSRG Technical Report 396, University of Toronto, March 2000.
M. Chechik, S. Easterbrook, and V Petrovykh. “Model-Checking Over Multi-Valued Logics”. In Proceedings of FME’01, volume 2021 of LNCS, pages 72–98. Springer, March 2001.
E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
B.A. Davey and H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
B. Devereux. Symbolic representation and reasoning over state-based models with multiplicities. Master’s thesis, University of Toronto, Department of Computer Science, June 2001.
E.W. Dijkstra and C.S. Scholten. Predicate Calculus and Program Semantics. Springer, 1990.
J.M. Dunn. “A Comparative Study of Various Model-Theoretic Treatments of Negation: A History of Formal Negation”. In Dov Gabbay and Heinrich Wansing, editors, What is Negation. Kluwer Academic Publishers, 1999.
S. Easterbrook and M. Chechik. “A Framework for Multi-Valued Reasoning over Inconsistent Viewpoints”. In Proceedings of International Conference on Software Engineering (ICSE’01), pages 411–420, May 2001.
Melvin Fitting. “Many-Valued Modal Logics”. Fundamenta Informaticae, 15(3–4):335–350, 1991.
Melvin Fitting. “Many-Valued Modal Logics II”. Fundamenta Informaticae, 17:55–73, 1992.
Brian R. Gaines. “Logical Foundations for Database Systems”. International Journal of Man-Machine Studies, 11(4):481–500, 1979.
Matthew Ginsberg. “Multi-valued logic”. In M. Ginsberg, editor, Readings in Nonmonotonic Reasoning, pages 251–255. Morgan-Kaufmann Pub., 1987.
Reiner Hähnle. Automated Deduction in Multiple-Valued Logics, volume 10 of International Series of Monographs on Computer Science. Oxford University Press, 1994.
S. Hazelhurst. Compositional Model Checking of Partially Ordered State Spaces. PhD thesis, Department of Computer Science, University of British Columbia, 1996.
J. Lukasiewicz. Selected Works. North-Holland, Amsterdam, Holland, 1970.
R. S. Michalski. “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.
E. Santos. “Regular Fuzzy Expressions”. In Madan M. Gupta, George N. Saridis, and Brian R. Gaines, editors, Fuzzy Automata and Decision Processes, pages 169–176, New York, 1977. North-Holland.
Viorica Sofronie-Stokkermans. Automated theorem proving by resolution for finitely-valued logics based on distributive lattices with operators. Multiple-Valued Logic, 2000.
Fabio Somenzi. “Binary Decision Diagrams”. In Manfred Broy and Ralf Steinbrüggen, editors, Calculational System Design, volume 173 of NATO Science Series F: Computer and Systems Sciences, pages 303–366. IOS Press, 1999.
L.A. Zadeh. “Fuzzy Sets”. In R. R. Yager, S. Ovchinnikov, R. M. Tong, and H. T. Nguyen, editors, Fuzzy Sets and Applications: Selected Papers by L.A. Zadeh, pages 29–44, New York, 1987. John Wiley & Sons, Inc.
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., Easterbrook, S., Lai, A.Y.C., Petrovykh, V. (2001). Efficient Multiple-Valued Model-Checking Using Lattice Representations. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_30
Download citation
DOI: https://doi.org/10.1007/3-540-44685-0_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42497-0
Online ISBN: 978-3-540-44685-9
eBook Packages: Springer Book Archive