{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:14:49Z","timestamp":1754482489494},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673064"},{"type":"electronic","value":"9783540464150"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719839_37","type":"book-chapter","created":{"date-parts":[[2007,4,11]],"date-time":"2007-04-11T08:13:55Z","timestamp":1176279235000},"page":"377-386","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Undecidable Problems in Unreliable Computations"],"prefix":"10.1007","author":[{"given":"Richard","family":"Mayr","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,4,12]]},"reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"P. Abdulla","year":"1998","unstructured":"Abdulla, P., Bouajjani, A., Jonsson, B.: On-the-fly Analysis of Systems with Unbounded, Lossy Fifo Channels. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427. Springer, Heidelberg (1998)"},{"key":"37_CR2","volume-title":"LICS 1993","author":"P. Abdulla","year":"1993","unstructured":"Abdulla, P., Jonsson, B.: Verifying Programs with Unreliable Channels. In: LICS 1993, IEEE, Los Alamitos (1993)"},{"issue":"1","key":"37_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.1996.0083","volume":"130","author":"P. Abdulla","year":"1996","unstructured":"Abdulla, P., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. Information and Computation\u00a0130(1), 71\u201390 (1996)","journal-title":"Information and Computation"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-49116-3_30","volume-title":"STACS 99","author":"A. Bouajjani","year":"1999","unstructured":"Bouajjani, A., Mayr, R.: Model checking lossy vector addition systems. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, p. 323. Springer, Heidelberg (1999)"},{"issue":"1","key":"37_CR5","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1996","unstructured":"C\u00e9c\u00e9, G., Finkel, A., Iyer, S.P.: Unreliable Channels Are Easier to Verify Than Perfect Channels. Information and Computation\u00a0124(1), 20\u201331 (1996)","journal-title":"Information and Computation"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR\u201993","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation equivalence is decidable for Basic Parallel Processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715. Springer, Heidelberg (1993)"},{"doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. LNCS, vol.\u00a0131, pp. 52\u201371 (1981)","key":"37_CR7","DOI":"10.1007\/BFb0025774"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, p. 103. Springer, Heidelberg (1998)"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1999","unstructured":"Dufourd, C., Jan\u010dar, P., Schnoebelen, P.: Boundedness of Reset P\/T Nets. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, p. 301. Springer, Heidelberg (1999)"},{"key":"37_CR10","volume-title":"Handbook of Theoretical Computer Science: FORMAL MODELS AND SEMANTICS","author":"E.A. Emerson","year":"1994","unstructured":"Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: FORMAL MODELS AND SEMANTICS, vol.\u00a0B. Elsevier, Amsterdam (1994)"},{"key":"37_CR11","volume-title":"Proc. of LICS 1999","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: Proc. of LICS 1999. IEEE, Los Alamitos (1999)"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60045-0_62","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"1995","unstructured":"Esparza, J., Kiehn, A.: On the model checking problem for branching time logics and Basic Parallel Processes. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939. Springer, Heidelberg (1995)"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-10003-2_79","volume-title":"Automata, Languages and Programming","author":"M. Hennessy","year":"1980","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 295\u2013309. Springer, Heidelberg (1980)"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of Association of Computer Machinery\u00a032, 137\u2013162 (1985)","journal-title":"Journal of Association of Computer Machinery"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1017\/S0960129500000992","volume":"6","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: Apolynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes. Journal of Mathematical Structures in Computer Science\u00a06, 251\u2013259 (1996)","journal-title":"Journal of Mathematical Structures in Computer Science"},{"key":"37_CR16","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. TCS\u00a027, 333\u2013354 (1983)","journal-title":"TCS"},{"key":"37_CR17","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. SIAM Journal of Computing\u00a013, 441\u2013460 (1984)","journal-title":"SIAM Journal of Computing"},{"key":"37_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62034-6_40","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R. Mayr","year":"1996","unstructured":"Mayr, R.: Weak bisimulation and model checking for Basic Parallel Processes. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180. Springer, Heidelberg (1996)"},{"key":"37_CR19","volume-title":"Computation: Finite and Infinite Machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"37_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60915-6","volume-title":"CONCUR \u201996: Concurrency Theory","author":"F. Moller","year":"1996","unstructured":"Moller, F.: Infinite results. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, Springer, Heidelberg (1996)"},{"key":"37_CR21","volume-title":"Petri net theory and the modeling of systems","author":"J.L. Peterson","year":"1981","unstructured":"Peterson, J.L.: Petri net theory and the modeling of systems. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"37_CR22","volume-title":"FOCS 1977","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS 1977. IEEE, Los Alamitos (1977)"},{"key":"37_CR23","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00290732","volume":"19","author":"K. Ruohonen","year":"1983","unstructured":"Ruohonen, K.: On some variants of Post\u2019s correspondence problem. Acta Informatica\u00a019, 357\u2013367 (1983)","journal-title":"Acta Informatica"},{"issue":"1","key":"37_CR24","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0890-5401(92)90059-O","volume":"96","author":"H. Yen","year":"1992","unstructured":"Yen, H.: A unified approach for deciding the existence of certain Petri net paths. Information and Computation\u00a096(1), 119\u2013137 (1992)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","LATIN 2000: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719839_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T07:38:28Z","timestamp":1567237108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719839_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673064","9783540464150"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/10719839_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"12 April 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}