{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T20:01:14Z","timestamp":1759694474189},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638117"},{"type":"electronic","value":"9783540696513"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0025037","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:56:54Z","timestamp":1132387014000},"page":"93-107","source":"Crossref","is-referenced-by-count":6,"title":["Formal representation and proof of the interpreted sequential machine model"],"prefix":"10.1007","author":[{"given":"Mireille","family":"Larnac","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Chapurlat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janine","family":"Magnier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Chenot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"8_CR1","volume-title":"Logique Temporelle \u2014 S\u00e9mantique et validation de programmes parall\u00e8les","author":"E. Audureau","year":"1990","unstructured":"Audureau, E., Enjalbert, P., Farinas del Cerro, L.: Logique Temporelle \u2014 S\u00e9mantique et validation de programmes parall\u00e8les. Masson, Paris (1990)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/157485.164585"},{"key":"8_CR3","unstructured":"Chenot, B., Larnac, M.: Utilization of graph theory notions in the Interpreted Sequential Machine. SOLO-IIA'97, to appear (1997)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. 7th ACM Symposium on Principles of Programming Languages (1980)","DOI":"10.1145\/567446.567462"},{"key":"8_CR5","volume-title":"Algebraic Structure Theory of Sequential Machines","author":"J. Hartmanis","year":"1966","unstructured":"Hartmanis, J., Stearns, R.E.: Algebraic Structure Theory of Sequential Machines. Prentice hall, Englewood Cliffs, N.J. (1966)"},{"key":"8_CR6","unstructured":"Kohavi, Z.: Switching and Finite Automata Theory. Tata McGraw Hill, Computer Science Series (1978)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/BFb0034757"},{"key":"8_CR8","volume-title":"Repr\u00e9sentation symbolique et v\u00e9rification formelle de machines s\u00e9quentielles","author":"J. Magnier","year":"1990","unstructured":"Magnier, J.: Repr\u00e9sentation symbolique et v\u00e9rification formelle de machines s\u00e9quentielles. PhD Thesis, University of Montpellier II, France (July 1990)"},{"key":"8_CR9","unstructured":"Magnier, J., Pearson, D., Giambiasi, N.: The Temporal Boolean Derivative Applied to Verification of Sequential Machines. European Simulation Symposium, Istanbul, Turkey (1994)"},{"key":"8_CR10","unstructured":"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)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1016\/0898-1221(95)00075-A"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory \u2014 EUROCAST'97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0025037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:38:48Z","timestamp":1586569128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0025037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638117","9783540696513"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0025037","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}