{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:52Z","timestamp":1725455692350},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540544771"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023740","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:01:03Z","timestamp":1132380063000},"page":"263-271","source":"Crossref","is-referenced-by-count":0,"title":["The algebraic feedback product of automata"],"prefix":"10.1007","author":[{"given":"Victor","family":"Yodaiken","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Ari, A. Pnueli, and Z. Manna. The temporal logic of branching time. Acta Informatica, 20, 1983.","DOI":"10.1007\/BF01257083"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"R. T. Boute. On the shortcomings of the axiomatic approach as presently used in computer science. In Compeuro 88 Systems Design: Concepts Methods, and Tools, 1988.","DOI":"10.1109\/CMPEUR.1988.4951"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"E. M. Clarke, Emerson A., and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications: A practical approach. In Proceedings of the 10th Annual Symposium on Principles of Programming Languages, pages 117\u2013119, 1983.","DOI":"10.1145\/567067.567080"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"E.M. Clarke, M.C. O. Grumberb, and Browne. Reasoning about networks with many identical finite state processes. Technical Report cmu-cs-86-155, Carnegie-Mellon University, October 1986.","DOI":"10.21236\/ADA188743"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and J. Y. Halpern. Sometimes and\u2019 not never\u2019 revisited: on branching versus linear time temporal logic. Journal of the ACM, 33(1), January 1983.","DOI":"10.1145\/4904.4999"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"G. Gouda, M. and C. Chang. Proving liveness for networks of communicating finite state machines. ACM Transactions on Programming Languages and Systems, 8(1), January 1986.","DOI":"10.1145\/5001.5002"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Ferenc Gecseg. Products of Automata. Monographs in Theoretical Computer Science. Springer Verlag, 1986.","DOI":"10.1007\/978-3-642-61611-2"},{"key":"28_CR8","volume-title":"Recursive Number Theory","author":"R. L. Goodstein","year":"1957","unstructured":"R. L. Goodstein. Recursive Number Theory. North Holland, Amsterdam, 1957."},{"key":"28_CR9","unstructured":"D. Harel. Statecharts: A visual formalism for complex systems. Technical report, Weizmann Institute, 1984."},{"key":"28_CR10","unstructured":"D. Harel. On the formal semantics of statecharts. In Proceedings of the Symposium on Logic in Computer Science, Ithaca, June 1987."},{"key":"28_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"John E. Hopcroft and Jeffry D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Welsey, Reading MA, 1979."},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"F. Kroger. Temporal Logic of Programs. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-71549-5"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Kurshan. Modelling concurrent processes. In Proc of Symposia in Applied Mathematics., 1985.","DOI":"10.1090\/psapm\/031\/807813"},{"volume-title":"Sequential Machines: Selected Papers","year":"1964","key":"28_CR14","unstructured":"E.F. Moore, editor. Sequential Machines: Selected Papers. Addison-Welsey, Reading MA, 1964."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The modal logic of programs. In Proceedings of the 6th International Colloquium on Automata, Languages, and Programming, volume 71 of Lecture Notes in Computer Science, New York, 1979. Springer-Verlag.","DOI":"10.1007\/3-540-09510-1_31"},{"key":"28_CR16","unstructured":"J.S. Ostroff and W.M. Wonham. Modelling, specifying, and verifying real-time embedded computer systems. In Symposium on Real-Time Systems, Dec 1987."},{"key":"28_CR17","unstructured":"Rozsa Peter. Recursive functions. Academic Press, 1967."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"C. Smorynski Self-Reference and Modal Logic. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4613-8601-8"}],"container-title":["Lecture Notes in Computer Science","Computer-Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0023740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:26:42Z","timestamp":1586568402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023740"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540544771"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0023740","relation":{},"subject":[]}}