Abstract
A multi-valued version of CTL* (mv-CTL*), where both the propositions and the accessibility relation are multi-valued taking values in a finite quasi-boolean algebra, is considered. A general translation from mv-CTL* to CTL* model checking is defined. An application of the translation is shown for the most commonly used quasi-boolean algebras.
Partly supported by the State Committee for Scientific Research under the grant No. 7T11C 00620, and by the EU Framework V research project ALFEBIITE.
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.
Similar content being viewed by others
References
A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. of TACAS’99, volume 1579 of LNCS, pages 193–207. Springer-Verlag, 1999.
G. Bruns and P. Godefroid. Model checking partial state spaces. In Proc. of CAV’99, volume 1633 of LNCS, pages 274–287. Springer-Verlag, 1999.
G. Bruns and P. Godefroid. Generalized model checking: reasoning about partial state spaces. In Proc. of CONCUR’00, volume 1877 of LNCS, pages 168–182. Springer-Verlag, 2000.
R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers, 35(8):677–691, 1986.
R. Bryant. Binary Decision Diagrams and beyond: Enabling technologies for formal verification. In Proc. of Int. Conf. on Computer-Aided Design (ICCAD’95), pages 236–243, 1995.
M. Chechik. On interpreting results of model-checking with abstraction. Technical Report 417, University of Toronto, 2000.
M. Chechik, B. Devereux, and S. Easterbrook. Implementing a multi-valued symbolic model-checker. In Proc. of TACAS’01, volume 2031 of LNCS, pages 404–419. Springer-Verlag, 2001.
M. Chechik, B. Devereux, S. Easterbrook, A. Y. C. Lai, and V. Petrovykh. Efficient multiple-valued model-checking using lattice representations. In Proc. of CONCUR’01, volume 2154 of LNCS, pages 441–455. Springer-Verlag, 2001.
M. Chechik, B. Devereux, and A. Gurfinkel. Model checking infinite state-spaces systems with fine-grained abstractions using spin. In Proc. of SPIN’01, volume 2057 of LNCS, pages 16–36. Springer-Verlag, 2001.
M. Chechik, S. Easterbrook, and V. Petrovykh. Model checking over multi-valued temporal logics. In Proc. of FME’01, volume 2001 of LNCS, pages 72–98. Springer-Verlag, 2001.
E. M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. In Proc. of CAV’93, volume 697 of LNCS, pages 450–462. Springer-Verlag, 1993.
E. M. Clarke, O. Grümberg, and D. Peled. Model Checking. MIT Press, 1999.
D. Dams, R. Gerth, G. Dohmen, R. Herrmann, P. Kelb, and H. Pargmann. Model checking using adaptive state and data abstraction. In Proc. of CAV’94, volume 818 of LNCS, pages 455–467. Springer-Verlag, 1994.
D. Dams, O. Grümberg, and R. Gerth. Abstract interpretation of reactive systems: Abstractions preserving ACTL*, ECTL* and CTL*. In Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET’ 94). Elsevier Science Publishers, 1994.
S. Easterbrook and M. Chechik. A framework for multi-valued reasoning over inconsistent viewpoints. In Proc. of ICSE’01, pages 411–420, 2001.
E. A. Emerson. Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter Temporal and Modal Logic, pages 995–1067. Elsevier, 1990.
E. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9:105–131, 1995.
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.
R. Gerth, R. Kuiper, D. Peled, and W. Penczek. A partial order approach to branching time logic model checking. Information and Computation, 150:132–152, 1999.
S. Hazelhurst. Compositional model checking of partially ordered state spaces. PhD thesis, University of British Columbia, 1996.
B. Konikowska and W. Penczek. Model checking for multi-valued computation tree logics. In M. Fitting and E. Orlowska, editors, Beyond Two: Theory and Applivations of Multiple Valued Logic. to appear, 2002.
K. L. McMillan. A technique of a state space search based on unfolding. Formal Methods in System Design, 6(1):45–65, 1995.
D. Peled. Partial order reduction: Linear and branching temporal logics and process algebras. In Proc. of Partial Order Methods in Verification (POMIV’96), volume 29 of ACM/AMS DIMACS Series, pages 79–88. Amer. Math. Soc., 1996.
W. Penczek, M. Szreter, R. Gerth, and R. Kuiper. Improving partial order reductions for universal branching time properties. Fundamenta Informaticae, 43:245–267, 2000.
W. Penczek, B. Woźna, and A. Zbrzezny. Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae, 50, 2002. to appear.
W. Penczek, B. Woźna, and A. Zbrzezny. Branching time bounded model checking for elementary net systems. Report ICS PAS, 940, January 2002.
A. Valmari. Stubborn sets for reduced state space generation. In Proc. of the Int. Conf. on Applications and Theory of Petri Nets (ICATPN’89), volume 483 of LNCS, pages 491–515. Springer-Verlag, 1989.
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
Konikowska, B., Penczek, W. (2002). Reducing Model Checking from Multi-valued CTL* to CTL* . In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-45694-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44043-7
Online ISBN: 978-3-540-45694-0
eBook Packages: Springer Book Archive