{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:56:54Z","timestamp":1725494214379},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664123"},{"type":"electronic","value":"9783540483212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48321-7_12","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T12:57:55Z","timestamp":1194267475000},"page":"161-172","source":"Crossref","is-referenced-by-count":2,"title":["Modeling operating systems schedulers with multi-stack-queue grammars"],"prefix":"10.1007","author":[{"given":"Luca","family":"Breveglieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano Crespi","family":"Reghizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Cherubini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(88)90019-9","volume":"58","author":"F. J. Brandenburg","year":"1988","unstructured":"Brandenburg F. J.: On the Intersection of Stacks and Queues, in Theoretical Computer Science, Elsevier, vol. 58, pp. 69\u201380, 1988","journal-title":"Theoretical Computer Science"},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","first-page":"131","volume-title":"Real-Time Scheduling by Queue Automata","author":"B. L","year":"1992","unstructured":"Breveglieri, L., Cherubini, A., Crespi Reghizzi, S: Real-Time Scheduling by Queue Automata, in LNCS Formal Techniques in Real-Time and Fault-Tolerant Systems\u2019 92, n. 571, (J. Vytopil, ed.), pp. 131\u2013148, Springer Verlag, 1992"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Breveglieri, L., Cherubini, A. Citrini, C., Crespi Reghizzi, S.: Multi-Pushdown Stack Languages and Grammars, International Journal of Foundation of Computer Science, World Scientific, n., pp., 1996","DOI":"10.1142\/S0129054196000191"},{"key":"12_CR4","unstructured":"Breveglieri, L., Cherubini, A., Crespi Reghizzi, S: Syntax-Directed Scheduling, Int. Rep. 98-048, Dip. di Elettronica e Informazione, Politecnico di Milano, 1998"},{"issue":"3","key":"12_CR5","first-page":"219","volume":"1","author":"C. A","year":"1990","unstructured":"Cherubini, A., Citrini, C., Crespi Reghizzi, S., Mandrioli, D.: Breadth and Depth Grammars and Dequeue Automata International Journal of Foundations of Computer Science, World Scientific, vol. 1, n. 3, pp. 219\u2013232, 1990","journal-title":"World Scientific"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0304-3975(91)90053-5","volume":"85","author":"C. A","year":"1991","unstructured":"Cherubini, A., Citrini, C., Crespi Reghizzi, S., Mandrioli, D.: Quasi-Real-Time FIFO Automata, Breadth-first Grammars and their Relations, in Theoretical Computer Science, Elsevier, n. 85, pp.171\u2013203, 1991","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1006\/jcss.1996.0006","volume":"52","author":"C. A","year":"1996","unstructured":"Cherubini, A., San Pietro, P.: A Polynomial-Time Parsing Algorithm for k-Depth Languages, Journal of Computer Systems Science, vol. 52, n. 1, pp. 61\u201379, 1996","journal-title":"Journal of Computer Systems Science"},{"key":"12_CR8","unstructured":"Floyd, R., Beigel, R.: The Language of Machines, Freeman, 1994"},{"key":"12_CR9","volume-title":"The mathematical Theory of Context-free Languages","author":"G. S","year":"1968","unstructured":"Ginsburgh, S.: The mathematical Theory of Context-free Languages, McGraw-Hill, New York, 1968"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/32.56100","volume":"16","author":"H. D","year":"1990","unstructured":"Hemmendinger, D.: Specifying Ada Server Tasks with executable formal Grammars, in IEEE Transactions on Software Engineering, n. 16, pp. 741\u2013754, 1990","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/281258.281268","volume":"32","author":"K. S","year":"1998","unstructured":"Kang, S., Lee, H.: Analysis and Solution of non-Preemptive Policies for Scheduling Readers and Writers, in Operating Systems Review, ACM Press, vol. 32, n. 3, pp. 30\u201350, July, 1998","journal-title":"Operating Systems Review"},{"key":"12_CR12","volume-title":"Mathematical Theory of Computation","author":"M. Z","year":"1974","unstructured":"Manna, Z.: Mathematical Theory of Computation, McGraw Hill, New York, 1974"},{"key":"12_CR13","volume-title":"Operating Systems Concepts","author":"G. P","year":"1994","unstructured":"Galvin, P., Silberschatz, A.: Operating Systems Concepts, Addison Wesley, Reading, 1994"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(80)90047-X","volume":"11","author":"V. B","year":"1980","unstructured":"Vauquelin, B., Franchi-Zannettacci, P.: Automates \u00e0 File, in Theoretical Computer Science, Elsevier, n. 11, pp. 221\u2013225, 1980","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48321-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T05:22:10Z","timestamp":1556947330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48321-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664123","9783540483212"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48321-7_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}