Chapter PDF
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.
References
J. Brzozowski. Derivatives of regular expressions. Journal of the Association of Computing Machinery, 11(4):481–494, October 1964.
E. Clarke., E. Emerson, and A. Sistla. Automatic verification of finite state concurrent systems using temporal logic specification: a practical approach. ACM SIGACT-SIGOPS, Symp. Principles of Distributed Computing, 117–126, 1983.
E. Clarke and O. Grumberg. Avoiding the state explosion problem in temporal logic model checking algorithms. 6th ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing, Vancouver, Canada, August 1987.
O. Drissi-Kaitouni and C. Jard. Compiling temporal logic specifications into observers. Technical Report 881, IRISA University of Rennes, July 1988.
R. Groz. Vérification de propriétés logiques des protocoles et systèmes répartis par observation de simulations. Thèse de doctorat de l'universite de Rennes I, No 194, January 1989.
G. Holzmann. Automated protocol validation in argos, assertion proving and scatter searching. IEEE trans. on Software Engineering, Vol 13, No 6, June 1987.
C. Jard and M. Raynal. Specification of Properties is Required to Verify Distributed Algorithms. Technical Report 651, INRIA, Centre IRISA, Rennes, February 1987.
O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. 12th Symposium on Principles of Programming Languages, Austin, Texas, 97–107, 1984.
R. Mac Naughton and S. Papert. Counter free automata. MIT Press, Cambridge, Avril 1971.
Z. Manna and A. Pnueli. Specification and verification of concurrent programs by ∀-automata. 14th Symposium on Principles of Programming Languages, ACM, Munich, 1–12, January 1987.
Z. Manna and P. Wolper. Synthesis of communication processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68–98, Junary 1984.
J. Pageot and C. Jard. Experience in guiding simulation. Protocol Specification, Testing, and Verification, VIII, IFIP, 207–218, June 1988.
A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends. LNCS #224, Current Trends in Concurrency, 510–584, 1986.
J. Richier, C. Rodriguez, J. Sifakis, and J. Voiron. Verification in XESAR of the sliding window protocol. In 7th IFIP International Workshop on Protocol Specification, Testing, and Verification, Zurich, Suisse, North Holland, May 1987.
J. Sifakis. A response to amir pnueli's: specification and development of reactive systems. IFIP'86, Dublin, 1986.
W. Thomas. A combinatorial approach to the theory of ω-automata. Information and Control, 48(3):261–283, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jard, C., Jeron, T. (1990). On-line model-checking for finite linear temporal logic specifications. In: Sifakis, J. (eds) Automatic Verification Methods for Finite State Systems. CAV 1989. Lecture Notes in Computer Science, vol 407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52148-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-52148-8_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52148-8
Online ISBN: 978-3-540-46905-6
eBook Packages: Springer Book Archive