Abstract
We develop efficient algorithms for model checking quantitative properties of symmetric reactive systems in the general framework of a Real-Time Mu-calculus. Previous work has been limited to qualitative correctness properties. Our work not only permits handling of quantitative correctness, but it provides a strictly more expressive framework for qualitative correctness since the Mu-calculus strictly subsumes, e.g, CTL. Unlike the previous “group-theoretic” approaches of [CE96] and [ES96] and the technical “automata-theoretic” approach of [ES97], our new approach may be viewed as “model-theoretic”.
The authors' work was supported in part by NSF grants CCR-941-5496 and CCR-980-4736 and SRC contract 97-DP-388.
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Courcoubetis, C., and Dill, D., Model Checking for Real-Time Systems. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pp. 414–425, IEEE Computer Society Press, 1990.
Alur, R., Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Stanford University, 1991.
Clarke, E. M., and Emerson, E. A., Design and Verification of Synchronization Skeletons using Branching Time Temporal Logic, Logics of Programs Workshop, IBM Yorktown Heights, New York, Springer LNCS no. 131., pp. 52–71, May 1981.
Clarke, E. M., Filkorn, T., and Jha, S., Exploiting Symmetry in Temporal Logic Model Checking. In Fifth International Conference on Computer Aided Verification, Crete, Greece, June 1993. Journal version appears as: Clarke, E. M., Enders, R. Filkorn, T. and Jha, S., Exploiting Symmetry in Temporal Logic Model Checking. In Formal Methods in System Design, Kluwer, vol. 9, no. 1/2, August 1996.
E. Allen Emerson Real-Time and the Μ-Calculus. In Proceedings of RealTime: Theory in Practice, LNCS, Vol. 600, pp. 176–194, Springer, June 1992.
Emerson, E. A., and Halpern, J. Y., ‘Sometimes’ and ‘Not Never’ Revisited: On Branching versus Linear Time Temporal Logic, JACM, vol. 33, no. 1, pp. 151–178, Jan. 1986.
Emerson, E. A., and Lei, C.-L., Efficient Model Checking in Fragments of the Mu-Calculus, IEEE Symp. on Logic in Computer Science (LICS), Cambridge, Mass., 1986.
Emerson, E. A., and Lei, C.-L.M. Modalities for Model Checking: Branching Time Strikes Back, pp. 84-96, ACM POPL85; journal version appears in Sci. Comp. Prog. vol. 8, pp 275–306, 1987.
Emerson, E. A., Mok, A. K., Sistla, A. P., and Srinivasan, J., Quantitative Temporal Reasoning. In Journal of Real Time Systems, vol. 4, pp. 331–352, 1992.
Emerson, E. A. and Sistla, A. P., Symmetry and Model Checking. In Fifth International Conference on Computer Aided Verification, Crete, Greece, June 1993. Journal Version appeared in Formal Methods in System Design, Kluwer, vol. 9, no. 1/2, August 1996.
Emerson, E. A. and Sistla, A. P., Utilizing Symmetry when Model Checking under Fairness Assumptions. In Seventh International Conference on Computer Aided Verification Springer-Verlag, 1995. Journal version, TOPLAS 19(4): 617–638 (1997).
Gyuris, V. and Sistla, A. P., On-the-Fly Model checking under Fairness that Exploits Symmetry. In Proceedings of the 9th International Conference on Computer Aided Verification, Haifa, Israel, 1997.
Henzinger, T., The Temporal Specification and Verification of Real-Time Systems, Ph.D. Thesis, Stanford University, 1991, report number STAN-CS-911380.
Ip, C-W. N., Dill, D. L., Better Verification through Symmetry. In Proc. 11th International Symposium on Computer Hardware Description Languages(CHDL), April, 1993. Journal version appeared in Formal Methods in System Design, Kluwer, vol. 9, no. 1/2, August 1996.
Jensen, K. and Rozenberg, G. (eds.), High-Level Petri Nets: Theory and Application, Springer-Verlag, 1991.
Kozen, D., Results on the Propositional Mu-Calculus, Theor. Comp. Sci., pp. 333–354, Dec. 83.
Litchtenstein, O., and Pnueli, A., Checking That Finite State Concurrent Programs Satisfy Their Linear Specifications, POPL85, pp. 97–107, Jan. 85.
Long, D., Browne, A., Clarke, E. Jha, S. and Marrero, W., An Improved Algorithm for the Evaluation of Fixpoint Expressions. In Proc. of the 6th Inter. Conf. on Computer Aided Verification, Stanford, Springer LNCS no. 818, June 1994.
Queille, J. P., and Sifakis, J., Specification and verification of concurrent programs in CESAR, Proc. 5th Int. Symp. Prog., Springer LNCS no. 137, pp. 195–220, 1982.
Seidl, H., A Modal Μ-Calculus for Durational Transition Systems. In Eleventh Annual IEEE Symposium on Logic In Computer Science, IEEE Computer Society Press, 1996.
Sistla, A. P., and Clarke, E. M., The Complexity of Propositional Linear Temporal Logic, J. ACM, Vol. 32, No. 3, pp.733–749, 1985.
Vardi, M., and Wolper, P., An Automata-theoretic Approach to Automatic Program Verification, Proc. IEEE LICS, pp. 332–344, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Emerson, E.A., Trefler, R.J. (1998). Model checking Real-Time properties of symmetric systems. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055792
Download citation
DOI: https://doi.org/10.1007/BFb0055792
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64827-7
Online ISBN: 978-3-540-68532-6
eBook Packages: Springer Book Archive