Abstract
We present a class of the temporal branching time logics designated for the specification of concurrent programs and incorporating all regular temporal operators. A linear time model checking procedure is given due to which an efficient verification of the temporal dependencies in programs is possible.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Arnold A. Crubille P. A linear algorithm to solve fixed-point equations on graphs, Rep. I-8632, Univ. de Bordeaux I.
Browne M.C. An improved algorithm for the automatic verification of finite state systems using temporal logic, Rep. CMU-CS-86-156, Carnegie-Mellon Univ.
Clarke E.M. Emerson E.A. Design and synthesis of synchronization skeletons using branching time temporal logic, LNCS 131,:52–71.
Clarke E.M. Emerson E.A. Sistla A.P. Automatic verification of finite state concurrent systems using temporal logic specifications, POPL-Symp.,:117–126; see also ACM Tran. on Prog. Lang. and Systems 8(2):244–263, 1986.
Clarke E.M., Grumberg O., Kurshan R.P. A synthesis of two approaches for verifying finite state concurrent systems, Report of the Carnegie Mellon Univ., 1987.
Emerson E.A. Clarke M. Using branching time temporal logic to synthesize synchronization skeletons, Sci. of Comp. Programming 2,:241–266.
Emerson E.A. Lei Ch-L. Modalities for model checking: branching time strickes back, POPL-Symp.,:84–96.
Emerson E.A. Lei Ch-L. Temporal model checking under generalized fairness constraints, Hawaii Int. Conf. System Sci.,1985.
Floyd R.W. Assigning meaning to programs, Proc. of Symp. in Applied Math.XIX, Am. Math. Soc.
Hailpern B. T. Verifying concurrent processes using temporal logic, LNCS 129.
Habasinski Z. Process logics: two decidability results, LNCS 176,:282–290.
Hoare C.A.R. The axiomatic basis of computer programming, Comm. of ACM 12,:576–583.
Kozen D. Results on the propositional Mu-calculus, Th. Comput. Sci. 27,:333–354.
Lamport L. Specifying concurrent modules, TOPLAS 5(2),:190–222.
Michel M. Algebre de machines et logique temporelle, LNCS 166, Proc. of STACS.
Manna Z. Pnueli A. Axiomatic approach to total correctness of programs, Acta Informatica 3.
Quielle J.P. Sifakis J. Specification of concurrent systems in CESAR, Proc. of the 5th Int. Symp. in Programming.
Salwicki A. Muldner T. On the algorithmic properties of concurrent programs, LNCS 125,:169–197.
Wolper P. Synthesis of Communicating Processes from temporal logic specifications, Ph.D.Thesis,Stanford Univ.,California.
Wolper P. Expressing interesting properties of programs in propositional temporal logic, POPL-Symp.,1986.
Wolper P. Vardi M.Y. Sistla A.P. Reasoning about infinite computation paths, FOCS-Symp.,:185–194.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Habasiński, Z. (1988). Regular automata and model checking. In: Dauchet, M., Nivat, M. (eds) CAAP '88. CAAP 1988. Lecture Notes in Computer Science, vol 299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026107
Download citation
DOI: https://doi.org/10.1007/BFb0026107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19021-9
Online ISBN: 978-3-540-38930-9
eBook Packages: Springer Book Archive