Abstract
We are interested in modular specification and verification of digital circuits. Hence we asked for an appropriate description logic. In [MC85,BCDM85] the temporal logic CTL has successfully been used to verify some circuits. This logic was choosen as it has a linear model checking algorithm, and thus proving specifications in models consisting of hundreds or thousands of states can be done efficiently. But, unfortunately, CTL does not support modular specification and verification. As other logics as CTL* or PTL, which are suitable for modular verification, have exponential model checking algorithms we looked for an extension of CTL which allows modular specifications and whose model checking algorithm is faster than that of CTL*. In this paper we present such a logic, called MCTL. Formulae of MCTL are given by two parts, one describing a property of a module — this is done by a CTL formula — and one describing some assumptions on the environment — this is done by a special kind of path formulae. The interpretation of such a formula is in such a way that the assumptions restrict the paths which are relevant for the path quantifiers in the CTL formula. We show how this logic can be used in a modular verification system using proof principles given in [Pn85].
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Aggarwal, R.P. Kurshan, K. Sabnani: A calculus for protocol specification and validation. Proc. IFIP Workshop on Protocol Specification, Testing, and Verification, III, 19–34 (1983)
M. Browne, E. Clarke, D. Dill, B. Mishra: Automatic verification of sequential circuits using temporal logic. Computer Hardware Description Languages and their Applications, 98–113 (1985)
E.M. Clarke, O. Grümberg: Avoiding the state explosion problem in temporal logic model checking algorithms. Technical Report Carnegie-Mellon-University, Pittsburgh (1987)
E.A. Emerson, J.Y. Halpern: Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences 30, 1–24 (1985)
E.A. Emerson, J.Y. Halpern: “Sometimes” and “not never” revisited: On branching versus linear time temporal logic. JACM 33, 151–178 (1986)
E.A. Emerson, C.L. Lei: Temporal reasoning under generalized fairness constraints. Proceedings STACS 86, Lecture Notes in Computer Science 210, 21–36 (1986)
B. Josko: Modelchecking of CTL formulae under liveness assumptions. Schriften zur Informatik und Angewandten Mathematik No. 124, RWTH Aachen (1986)
B. Josko: Modelchecking of CTL formulae under liveness assumptions. 14th ICALP, Lecture Notes in Computer Science 267, 280–289 (1987)
B. Josko: Modelchecking of CTL formulae under liveness and safety assumptions. Technical Report, RWTH Aachen (1987)
B. Josko: Modular verifications of digital circuits. (in preparation)
B. Mishra, E. Clarke: Hierarchical verification of asynchronous circuits using temporal logic. TCS 38, 269–291 (1985)
A. Pnueli: In transition from global to modular temporal reasoning about programs. in K.R. Apt(Ed.): Logics and Models of Concurrent Systems. Springer-Verlag, 123–144 (1985)
A.P. Sistla, E.M. Clarke: The complexity of propositional linear temporal logic. Journal of the ACM 32, 733–749 (1985)
C.L. Seitz: System timing. in: C.A. Mead, L. Conway: Introduction to VLSI Systems. Adison-Wesley, Reading, Mass. (1980)
VMEbus, Specification manual (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Josko, B. (1989). MCTL — An extension of CTL for modular verification of concurrent systems. In: Banieqbal, B., Barringer, H., Pnueli, A. (eds) Temporal Logic in Specification. Lecture Notes in Computer Science, vol 398. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51803-7_25
Download citation
DOI: https://doi.org/10.1007/3-540-51803-7_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51803-7
Online ISBN: 978-3-540-46811-0
eBook Packages: Springer Book Archive