{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T01:24:18Z","timestamp":1787361858601,"version":"build-2736575974"},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540544771","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023741","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T01:01:03Z","timestamp":1132362063000},"page":"272-281","source":"Crossref","is-referenced-by-count":13,"title":["Synthesizing processes and schedulers from temporal specifications"],"prefix":"10.1007","author":[{"given":"Howard","family":"Wong-Toi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David L.","family":"Dill","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur and D. Dill, \u201cAutomata for modeling real-time systems\u201d, ICALP 1990.","DOI":"10.1007\/BFb0032042"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"M. Abadi, L. Lamport, P. Wolper, \u201cRealizable and unrealizable specifications of reactive systems\u201d, International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, 1989, Springer-Verlag","DOI":"10.1007\/BFb0035748"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"H. Barringer, R. Kuiper and A. Pnueli, \u201cNow you can compose temporal logic specifications\u201d, Proceedings of the ACM Symposium on Theory of Computing, 1984, pp. 51\u201363.","DOI":"10.1145\/800057.808665"},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J. R. B\u00fcchi","year":"1969","unstructured":"J. R. B\u00fcchi and L. H. Landweber, \u201cSolving sequential conditions by finite-state strategies\u201d, Transactions of the American Mathematical Society, 138, 1969, pp. 295\u2013311.","journal-title":"Transactions of the American Mathematical Society"},{"key":"29_CR5","unstructured":"S-C. Cheng and J. A. Stankovic, \u201cScheduling algorithms for hard real-time systems \u2014 a brief survey\u201d, in Hard Real-Time Systems, IEEE Press, 1988, pp. 150\u2013173."},{"key":"29_CR6","unstructured":"A. Church, \u201cLogic, arithmetic, and automata\u201d, in Proceedings of the International Congress of Mathematicians, 1962, Institut Mittag-Leffler, 1963, pp. 23\u201335."},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"D.L. Dill, \u201cTrace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits\u201d, MIT Press, 1989.","DOI":"10.7551\/mitpress\/6874.001.0001"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, C.S. Jutla, \u201cThe complexity of tree automata and logics of programs\u201d, Proc. of the 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 328\u2013337.","DOI":"10.1109\/SFCS.1988.21949"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, C.S. Jutla, \u201cOn simultaneously determinizing and complementing \u03c9-automata\u201d, Pro. of the Symp. on Logic in Computer Science, 1989, pp. 333\u2013342.","DOI":"10.1109\/LICS.1989.39188"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"A. Pnueli, R. Rosner, \u201cOn the synthesis of a reactive module\u201d, Proc. 16th ACM Symp. Principles of Programming Languages, 1989, pp. 179\u2013190.","DOI":"10.1145\/75277.75293"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"A. Pnueli, R. Rosner, \u201cOn the synthesis of an asynchronous reactive module\u201d, International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science Vol 372, 1989, Springer-Verlag","DOI":"10.1007\/BFb0035790"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"M. O. Rabin, \u201cAutomata on infinite objects and church's problem\u201d, Regional Conference Series in Mathematics, Vol. 13, American Mathematical Society, 1972.","DOI":"10.1090\/cbms\/013"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"P. Wolper, M.Y. Vardi, A.P. Sistla, \u201cReasoning about infinite computation paths\u201d, Proc. of the 24th IEEE Symp. on Foundations of Computer Science, 1983, pp. 185\u2013194.","DOI":"10.1109\/SFCS.1983.51"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"H. Wong-Toi and D.L. Dill, \u201cSynthesizing processes and schedulers from temporal specifications\u201d, Computer-Aided Verification (Proc. CAV90 Workshop), DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 3 (American Mathematical Society, 1991).","DOI":"10.1090\/dimacs\/003\/13"}],"container-title":["Lecture Notes in Computer Science","Computer-Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0023741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:26:30Z","timestamp":1586553990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540544771"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0023741","relation":{},"subject":[]}}