Abstract
In this paper we introduce \(\mathcal{X}\)TCTL, a dense-time extension of the multi-valued Computation Tree Logic (\(\mathcal{X}\)CTL) in [1]. Alternatively, \(\mathcal{X}\)TCTL is a multi-valued extension of TCTL [2] over quasi-boolean algebras. A multi-valued quotient is defined which enables to reduce dense-time \(\mathcal{X}\)TCTL model checking to the untimed case.
This work was partially supported by the Xunta de Galicia Basic Research Project PGIDIT04PXIB32201PR.
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
Chechik, M., Devereux, B., Gurfinkel, A., Easterbrook, S.: Multi-Valued Symbolic Model-Checking. ACM Transactions on Software Engineering and Methodology 12(4), 1–38 (2003)
Alur, R., Courcoubetis, C., Dill, D.: Model Checking in Dense Real-time. Information and Computation 104(1), 2–34 (1993)
Konikowska, B., Penczek, W.: Model Checking for Multi-Valued CTL*. In: Beyond Two: Theory and Applications of Multiple-valued Logic, pp. 193–210. Springer, Heidelberg (2003)
Alur, R.: Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Department of Computer Science, Stanford University (1991)
Alur, R., Henzinger, T.: A Really Temporal Logic. Journal of the ACM 41(1), 181–204 (1994)
Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model-checking for Real Time Systems. Information and Computation 111(2), 193–244 (1994)
Tripakis, S., Yovine, S.: Analysis of Timed Systems using Time-abstracting Bisimulations. Formal Methods in System Design 18(1), 25–68 (2001)
Yannakakis, M., Lee, D.: An Efficient Algorithm for Minimizing Real-Time Transition Systems. Formal Methods in System Design 11(2), 113–136 (1997)
Chechik, M., Gurfinkel, A., Devereux, B.: XChek: A Multi-Valued Model-Checker. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 505–509. Springer, Heidelberg (2002)
Bolc, L., Borowik, P.: Many-Valued logics 2. Automated Reasoning and Practical Applications, ch. 7, pp. 169–198. Springer, Heidelberg (2003)
Konikowska, B., Penczek, W.: Reducing Model Checking from Multi-Valued CTL ∗ to CTL ∗ . In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 226–239. Springer, Heidelberg (2002)
Gurfinkel, A., Chechik, M.: Multi-valued model checking via classical model checking. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 266–280. Springer, Heidelberg (2003)
Pazos Arias, J.J., Duque, J.G.: SCTL-MUS: A Formal Methodology for Software Development of Distributed Systems. A Case Study. Formal Aspects of Computing 13, 50–91 (2001)
Vilas, A.F., Pazos Arias, J.J., Díaz Redondo, R.P.: Extending timed automaton and real-time logic to many-valued reasoning. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol. 2469, pp. 185–204. Springer, Heidelberg (2002)
Vilas, A.F., Pazos Arias, J.J., Solla, A.G., Redondo, R.P.D., Duque, J.G., Belén Barragáns Martínez, A.: Incremental Specification with SCTL/MUS-T: a Case Study. The Journal of Systems & Software 70(1-2), 189–208 (2004)
Vilas, A.F., Pazos Arias, J.J., Redondo, R.P.D., Solla, A.G., Duque, J.G.: A many-valued logic with imperative semantics for incremental specification of timed models. In: Boiten, E.A., Derrick, J., Smith, G.P. (eds.) IFM 2004. LNCS, vol. 2999, pp. 382–401. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vilas, A.F. et al. (2005). Multi-valued Model Checking in Dense-Time. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_54
Download citation
DOI: https://doi.org/10.1007/11518655_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27326-4
Online ISBN: 978-3-540-31888-0
eBook Packages: Computer ScienceComputer Science (R0)