{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:16Z","timestamp":1725549496367},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_8","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:40:30Z","timestamp":1268401230000},"page":"84-96","source":"Crossref","is-referenced-by-count":1,"title":["Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages"],"prefix":"10.1007","author":[{"given":"Bharat","family":"Adsul","sequence":"first","affiliation":[]},{"given":"Milind","family":"Sohoni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Adsul, B.: Complete Local Logics for Reasoning about Traces, Ph.D. Thesis, Indian Institute of Technology \u2013 Bombay, Mumbai, India (2004)"},{"volume-title":"Algebraic Theory of Machines, Languages and Semigroups","year":"1968","key":"8_CR2","unstructured":"Arbib, M.A. (ed.): Algebraic Theory of Machines, Languages and Semigroups. Academic Press, New York (1968)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/3-540-61377-3_41","volume-title":"Computer Science Logic","author":"M. Droste","year":"1996","unstructured":"Droste, M., Kuske, D.: Languages and Logical Definability in Concurrency Monoids. In: Kleine B\u00fcning, H. (ed.) CSL 1995. LNCS, vol.\u00a01092, pp. 233\u2013251. Springer, Heidelberg (1996)"},{"volume-title":"The Book of Traces","year":"1995","key":"8_CR4","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-56939-1_84","volume-title":"Automata, Languages and Programming","author":"W. Ebinger","year":"1993","unstructured":"Ebinger, W., Muscholl, A.: Logical Definability on Infinite Traces. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 335\u2013346. Springer, Heidelberg (1993)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0304-3975(92)90080-Y","volume":"97","author":"G. Guaiana","year":"1992","unstructured":"Guaiana, G., Restivo, A., Salemi, S.: Star-free Trace Languages. Theoretical Computer Science\u00a097, 301\u2013311 (1992)","journal-title":"Theoretical Computer Science"},{"key":"8_CR7","volume-title":"Concurrent Program Schemes and Their Interpretations, Report DAIMI-PB-78, Comp Sci Dept","author":"A. Mazurkiewicz","year":"1978","unstructured":"Mazurkiewicz, A.: Concurrent Program Schemes and Their Interpretations, Report DAIMI-PB-78, Comp Sci Dept. Aarhus University, Denmark (1978)"},{"key":"8_CR8","volume-title":"Counter-free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-free Automata. MIT Press, Cambridge (1971)"},{"key":"8_CR9","unstructured":"Mukund, M., Sohoni, M.: Gossiping, Asynchronous Automata and Zielonka\u2019s Theorem, Report TCS-94-2, Chennai Mathematical Institute. Chennai, India (1994)"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s004460050031","volume":"10","author":"M. Mukund","year":"1997","unstructured":"Mukund, M., Sohoni, M.: Keeping Track of the Latest Gossip in a Distributed System. Distributed Computing\u00a010(3), 137\u2013148 (1997)","journal-title":"Distributed Computing"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"48","author":"M.P. Schutzenberger","year":"1965","unstructured":"Schutzenberger, M.P.: On Finite Monoids Having Only Trivial Subgroups. Information and Control\u00a048, 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, Automata and Logic. In: Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013456. Springer, New York (1997)"},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on Finite Asynchronous Automata. RAIRO Inform. Th\u00e9or. Appl.\u00a021, 99\u2013135 (1987)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:59Z","timestamp":1605761939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}