{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:12Z","timestamp":1725558972412},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642138232"},{"type":"electronic","value":"9783642138249"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13824-9_13","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T11:24:09Z","timestamp":1277983449000},"page":"148-160","source":"Crossref","is-referenced-by-count":0,"title":["Decidability and Undecidability Results on the Modal \u03bc-Calculus with a Natural Number-Valued Semantics"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Goyet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masami","family":"Hagiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshinori","family":"Tanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoret. Comput. Sci.\u00a027(3), 333\u2013354 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-45187-7_18","volume-title":"CONCUR 2003 - Concurrency Theory","author":"A. Gurfinkel","year":"2003","unstructured":"Gurfinkel, A., Chechik, M.: Multi-valued model checking via classical model checking. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 263\u2013277. Springer, Heidelberg (2003)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/978-3-540-27836-8_26","volume-title":"Automata, Languages and Programming","author":"G. Bruns","year":"2004","unstructured":"Bruns, G., Godefroid, P.: Model checking with multi-valued logics. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 281\u2013293. Springer, Heidelberg (2004)"},{"key":"13_CR4","unstructured":"Kameyama, Y., Kinoshita, Y., Nishizawa, K.: Weighted Kripke structures and refinement of models. In: 23rd Conference of Japan Society for Software Science and Technology (2006)"},{"issue":"1-2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2007.02.055","volume":"380","author":"M. Droste","year":"2007","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. Theor. Comput. Sci.\u00a0380(1-2), 69\u201386 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Meinecke, I.: A weighted \u03bc-calculus on words. In: Developments in Language Theory, 13th International Conference, DLT 2009, pp. 384\u2013395 (2009)","DOI":"10.1007\/978-3-642-02737-6_31"},{"key":"13_CR7","unstructured":"Ikarashi, D., Tanabe, Y., Nishizawa, K., Hagiya, M.: Modal \u03bc-calculus on min-plus algebra N\u2009\u221e\u2009. In: 10th Workshop on Programming and Programming Languages (PPL 2008), Japanese Society on Software Science and Technology, pp. 216\u2013230 (2008)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Simon, I.: Limited subsets of a free monoid. In: 19th Annual Symposium on Foundations of Computer Science, pp. 143\u2013150 (1978)","DOI":"10.1109\/SFCS.1978.21"},{"key":"13_CR9","volume-title":"Synchronization and Linearity: An Algebra for Discrete Event Systems","author":"F. Baccelli","year":"1992","unstructured":"Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.P.: Synchronization and Linearity: An Algebra for Discrete Event Systems. John Wiley & Sons, Chichester (1992)"},{"key":"13_CR10","unstructured":"Ikarashi, D., Tanabe, Y., Nishizawa, K., Hagiya, M.: Modal \u03bc-calculus on min-plus algebra N-infinity. In: Computer Software, Japan Society for Software Science and Technology (to appear)"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E.L. Post","year":"1946","unstructured":"Post, E.L.: A variant of a recursively unsolvable problem. Bull. Amer. Math. Soc.\u00a052(4), 264\u2013268 (1946)","journal-title":"Bull. Amer. Math. Soc."},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-36387-4_10","volume-title":"Automata, Logics, and Infinite Games","author":"J. Zappe","year":"2002","unstructured":"Zappe, J.: Modal \u03bc-calculus and alternating tree automata. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500, pp. 171\u2013184. Springer, Heidelberg (2002)"},{"key":"13_CR13","unstructured":"Tanabe, Y., Hagiya, M.: Fixed-point computations over functions on integers with operations min, max and plus. In: 6th Workshop on Fixed Points in Computer Science (FICS 2009), pp. 108\u2013115 (2009)"},{"key":"13_CR14","unstructured":"Goyet, A., Hagiya, M., Tanabe, Y.: Decidability and undecidability results of modal \u03bc-calculi with N\u221e semantics. In: PRO Workshop, Information Processing Society of Japan (June 2009), http:\/\/cent.xii.jp\/tanabe.yoshinori\/09\/06\/ninfmu.pdf"},{"key":"13_CR15","unstructured":"Tanabe, Y., Hagiya, M.: Games and natural number-valued semantics of the modal \u03bc-calculus. In: 26th Conference of Japan Society for Software Science and Technology (2009), http:\/\/cent.xii.jp\/tanabe.yoshinori\/09\/09\/72.pdf"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata and tree automata emptiness. In: 30th Annual ACM Symposium on the Theory of Computing, pp. 224\u2013233 (1998)","DOI":"10.1145\/276698.276748"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Wilke, T.: Alternating tree automata, parity games, and modal \u03bc-calculus. Bull. Soc. Math. Belg.\u00a08(2) (2001)","DOI":"10.36045\/bbms\/1102714178"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13824-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T09:51:05Z","timestamp":1591437065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13824-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642138232","9783642138249"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13824-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}