Abstract
This paper presents a temporal logic MCTL which is suitable for modular specification and verification of computer architectures. MCTL has the advantage that open systems can be specified and verified; i.e. it allows the specification of properties under some assumptions on the environment. The module concept may help to solve the state explosion problem in the verification of temporal logic specifications. To verify the correctness of an implementation we describe a model checking algoritm for that logic.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6 References
W. Damm, G. Döhmen, B. Josko, F. Korf, T. Peikenkamp: AADL Language Document. Internal report, University of Oldenburg, 1989
M. Ben-Ari, Z. Manna, A. Pnueli: The temporal logic of branching time. Acta Informatica 20, 207–226 (1983)
E.M. Clarke, E.A. Emerson, A.P. Sistla: Automatic verification of finite-state concurrent systems using temporal logic specifications: a practical approach. Tenth ACM Symposium on Principles of Programming Languages, 117–126 (1983)
W.Damm, G. Döhmen: AADL: A net based specification method for computer architecture design. in: de Bakker (Ed.): Languages for Parallel Architectures: Design, Semantics, and Implementation Models, Wiley & Sons (1990)
W. Damm, G. Döhmen, V. Gerstner, B. Josko: Modular verification of Petri nets: The temporal logic approach. REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness. 1989
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. Journal of the ACM 33, 151–178 (1986)
E.A. Emerson, C.L. Lei: Modalities for model checking: branching time logic strikes back. Technical Report, Dep. of Computer Sciences, University of Texas (1985)
B. Josko: Modelchecking of CTL formulae under liveness assumptions. Proceedings of 14th ICALP-Conference, Lecture Notes in Computer Science 267, 280–289 (1987)
B. Josko: Modelchecking of CTL formulae under liveness and safety assumptions. Internal report, University of Oldenburg (1989)
Z. Manna, A. Pnueli: Verification of concurrent programs: The temporal framework. in: R,S. Boyer, J.S. Moore (Eds.): The Correctness Problem in Computer Science. Academic Press (1981)
A.P. Sistla, E.M. Clarke: The complexity of propositional temporal logic. 14th ACM Symposium on Theory of Computing, 157–167 (1982)
A.P. Sistla, E.M. Clarke: The complexity of propositional linear temporal logic. Journal of the ACM 32, 733–749 (1985)
R. Tarjan: Depth-first search and linear graph algorithms. SIAM Journal of Computing 1, 146–160 (1972)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Josko, B. (1990). Verifying the correctness of AADL modules using model checking. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness. REX 1989. Lecture Notes in Computer Science, vol 430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52559-9_72
Download citation
DOI: https://doi.org/10.1007/3-540-52559-9_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52559-2
Online ISBN: 978-3-540-47035-9
eBook Packages: Springer Book Archive