Abstract
The Interpreted Sequential Machine (ISM) model handles a new approach for modeling and formal verification of discrete complex systems.
The ISM is a state model and constitutes an extension of the classical Sequential Machine by the addition of a Data Part which contains data and operations. Furthermore, the inputs and outputs of an ISM model can be of any type (Boolean, integer, real, structured type, etc.). The ISM model is a powerful tool for representing the behavior of discrete complex systems, and furthermore permits to perform formal verification by proof of properties. This process is based on the translation of the behavior of the ISM model into a formal system such as Temporal Logic. The verification of properties then consists in proving the satisfiability or validity of some formula.
This project is supported by Merlin Gerin-Schneider, the Ecole des Mines d'Alès, FIBA and FEDER Objectif 2
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Audureau, E., Enjalbert, P., Farinas del Cerro, L.: Logique Temporelle — Sémantique et validation de programmes parallèles. Masson, Paris (1990)
Cheng, K.T., Krishnakumar, A.S.: Automatic functional test generation using the Extended Finite State Machine Model. 30th ACM/IEEE Design Automation Conference, USA (1993)
Chenot, B., Larnac, M.: Utilization of graph theory notions in the Interpreted Sequential Machine. SOLO-IIA'97, to appear (1997)
Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. 7th ACM Symposium on Principles of Programming Languages (1980)
Hartmanis, J., Stearns, R.E.: Algebraic Structure Theory of Sequential Machines. Prentice hall, Englewood Cliffs, N.J. (1966)
Kohavi, Z.: Switching and Finite Automata Theory. Tata McGraw Hill, Computer Science Series (1978)
Larnac, M., Magnier, J., Vandermeulen, E., Dray, G., Chapurlat, V.: Temporal and Functional Verification of a Symbolic Representation of Complex Systems. EUROCAST'95, Lecture Notes in Computer Science, volume 1030, Springer Verlag (1995)
Magnier, J.: Représentation symbolique et vérification formelle de machines séquentielles. PhD Thesis, University of Montpellier II, France (July 1990)
Magnier, J., Pearson, D., Giambiasi, N.: The Temporal Boolean Derivative Applied to Verification of Sequential Machines. European Simulation Symposium, Istanbul, Turkey (1994)
Manna, Z., Pnueli, A.: How to cook a temporal proof system for your pet language. Report No STAN-CS-82-954, Department of Computer Science, Stanford University (1982)
Vandermeulen, E., Donegan, H.A., Larnac, M., Magnier, J.: The Temporal Boolean Derivative Applied to Verification of Extended Finite State Machines. Computers and Mathematics with Applications, Vo1.30, N. 2 (January 1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larnac, M., Chapurlat, V., Magnier, J., Chenot, B. (1997). Formal representation and proof of the interpreted sequential machine model. In: Pichler, F., Moreno-Díaz, R. (eds) Computer Aided Systems Theory — EUROCAST'97. EUROCAST 1997. Lecture Notes in Computer Science, vol 1333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025037
Download citation
DOI: https://doi.org/10.1007/BFb0025037
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63811-7
Online ISBN: 978-3-540-69651-3
eBook Packages: Springer Book Archive