{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T23:15:46Z","timestamp":1648941346827},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1007\/bf02090765","type":"journal-article","created":{"date-parts":[[2005,8,15]],"date-time":"2005-08-15T07:01:07Z","timestamp":1124089267000},"page":"33-59","source":"Crossref","is-referenced-by-count":2,"title":["Communicating processes, scheduling, and the complexity of nontermination"],"prefix":"10.1007","volume":"23","author":[{"given":"Hsu-Chun","family":"Yen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02090765_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6423(83)90004-7","volume":"3","author":"K. Apt","year":"1983","unstructured":"Apt, K. and Olderog, E. Proof rules and transformations dealing with fairness.Science of Computer Programming, 3: 65\u2013100, 1983.","journal-title":"Science of Computer Programming"},{"key":"BF02090765_CR2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-3975(84)90103-8","volume":"33","author":"K. Apt","year":"1984","unstructured":"Apt, K., Pnueli, A. and Stavi, J. Fair termination revisited\u2014with delay.Theoretical Computer Science, 33:65\u201384, 1984.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"BF02090765_CR3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D. and Zafiropulo P. On communicating finite-state machines.Journal of the Association for Computing Machinery, 30(2):323\u2013342, 1983.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF02090765_CR4","doi-asserted-by":"crossref","unstructured":"Carstensen, H. Decidability questions for fairness in Petri nets.Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science. LNCS 247, pp. 396\u2013407, 1987.","DOI":"10.1007\/BFb0039622"},{"key":"BF02090765_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Francez, N.Fairness. Springer-Verlag, New York, 1986."},{"key":"BF02090765_CR6","doi-asserted-by":"crossref","unstructured":"Gouda, M. and Chang, C. A technique for proving liveness of communicating finite state machines with examples.Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing, pp. 38\u201349, 1984.","DOI":"10.1145\/800222.806734"},{"issue":"1","key":"BF02090765_CR7","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1145\/5001.5002","volume":"8","author":"M. Gouda","year":"1986","unstructured":"Gouda, M. and Chang, C. Proving liveness for networks of communicating finite state machines.ACM Transactions on Programming Languages and Systems, 8(1):154\u2013182, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF02090765_CR8","unstructured":"Gouda, M. and Rosier, L. On deciding progress for a class of communication protocols.Proceedings of the 18th Annual Conference on Information Sciences and Systems, pp. 663\u2013667, 1984."},{"issue":"3","key":"BF02090765_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/0214042","volume":"14","author":"M. Gouda","year":"1985","unstructured":"Gouda, M. and Rosier, L. Priority networks of communicating finite state machines.SIAM Journal on Computing, 14(3):157\u2013166, 1985.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"BF02090765_CR10","first-page":"209","volume":"6","author":"M. Gouda","year":"1987","unstructured":"Gouda, M., Gurari, E., Lai, T. and Rosier, L. On deadlock detection in systems of communicating finite state machines.Computers and Artificial Intelligence, 6(3):209\u2013228, 1987.","journal-title":"Computers and Artificial Intelligence"},{"issue":"3","key":"BF02090765_CR11","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/2166.357214","volume":"5","author":"S. Hart","year":"1983","unstructured":"Hart, S., Sharir, M. and Pnueli, A. Termination of probabilistic concurrent programs.ACM Transactions on Programming Languages and Systems, 5(3):356\u2013380, 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"BF02090765_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0022-0000(87)90005-5","volume":"34","author":"R. Howell","year":"1987","unstructured":"Howell, R. and Rosier, L. An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines.Journal of Computer and System Sciences, 34(1):55\u201374, 1987.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02090765_CR13","first-page":"200","volume":"6","author":"R. Howell","year":"1988","unstructured":"Howell, R. and Rosier, L. On questions of fairness and temporal logic for conflict-free Petri nets.Advances in Petri Nets, 6:200\u2013226, 1988.","journal-title":"Advances in Petri Nets"},{"key":"BF02090765_CR14","doi-asserted-by":"crossref","unstructured":"Howell, R., Rosier, L. and Yen, H. A taxonomy of fairness and temporal logic problems for Petri nets.Proceedings of the 13th Symposium on Mathematical Foundations of Computer Science, pp. 351\u2013359, 1988.","DOI":"10.1007\/BFb0017158"},{"key":"BF02090765_CR15","doi-asserted-by":"crossref","unstructured":"Jancar, P. Decidability of weak fairness in Petri nets.Proceedings of the 6th Symposium on Theoretical Aspects of Computer Science, pp. 446\u2013457, 1989.","DOI":"10.1007\/BFb0029006"},{"issue":"2","key":"BF02090765_CR16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01699467","volume":"18","author":"T. Kasai","year":"1985","unstructured":"Kasai, T. and Iwata, S. Gradually intractable problems and nondeterministic log-space lower bounds.Mathematical Systems Theory, 18(2):153\u2013170, 1985.","journal-title":"Mathematical Systems Theory"},{"key":"BF02090765_CR17","doi-asserted-by":"crossref","unstructured":"Kosaraju, R. Decidability of reachability in vector addition systems.Proceedings of the 14th ACM Symposium on Theory of Computing, pp. 267\u2013280, 1982.","DOI":"10.1145\/800070.802201"},{"key":"BF02090765_CR18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-0000(80)90033-1","volume":"21","author":"R. Ladner","year":"1980","unstructured":"Ladner, R. The complexity of problems in systems of communicating sequential processes.Journal of Computer and System Sciences, 21:179\u2013194, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02090765_CR19","doi-asserted-by":"crossref","unstructured":"Lehmann, D., Pnueli, A. and Stavi, J. Impartiality, justice and fairness: the ethics of concurrent termination.Proceedings of the 8th International Colloquium on Automata, Languages and Programming. LNCS 115, pp. 264\u2013277, 1981.","DOI":"10.1007\/3-540-10843-2_22"},{"key":"BF02090765_CR20","unstructured":"Lipton, R. The reachability problem requires exponential space. Technical Report 62, Yale University, 1976."},{"issue":"3","key":"BF02090765_CR21","doi-asserted-by":"crossref","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 on Computing, 13(3):441\u2013460, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"BF02090765_CR22","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs, NJ, 1967."},{"key":"BF02090765_CR23","volume-title":"Petri Net Theory and the Modeling of Systems","author":"J. Peterson","year":"1981","unstructured":"Peterson, J.Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs, NJ, 1981."},{"key":"BF02090765_CR24","volume-title":"Operating System Concepts","author":"J. Peterson","year":"1983","unstructured":"Peterson, J. and Silberschatz A.Operating System Concepts. Addison-Wesley, Reading, MA, 1983."},{"key":"BF02090765_CR25","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C. The covering and boundedness problems for vector addition systems.Theoretical Computer Science, 6:223\u2013231, 1978.","journal-title":"Theoretical Computer Science"},{"key":"BF02090765_CR26","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00283332","volume":"25","author":"J. Reif","year":"1988","unstructured":"Reif, J. and Smolka, A. The complexity of reachability in distributed communicating processes.Acta Informatica, 25:333\u2013354, 1988.","journal-title":"Acta Informatica"},{"key":"BF02090765_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets\u2014An Introduction","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.Petri Nets\u2014An Introduction. Springer-Verlag, New York, 1985."},{"issue":"1","key":"BF02090765_CR28","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(86)90110-6","volume":"44","author":"L. Rosier","year":"1986","unstructured":"Rosier, L. and Yen, H. Boundedness, empty channel detection, and synchronization for communicating finite state automata.Theoretical Computer Science, 44(1):69\u2013106, 1986.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"BF02090765_CR29","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","volume":"32","author":"L. Rosier","year":"1986","unstructured":"Rosier, L. and Yen, H. A multiparameter analysis of the boundedness problem for vector addition systems.Journal of Computer and System Sciences, 32(1):105\u2013135, 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02090765_CR30","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(88)90031-X","volume":"58","author":"L. Rosier","year":"1988","unstructured":"Rosier, L. and Yen, H. On the complexity of deciding fair termination of probabilistic concurrent finite-state programs.Theoretical Computer Science, 58:263\u2013324, 1988.","journal-title":"Theoretical Computer Science"},{"key":"BF02090765_CR31","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0022-0000(77)80041-X","volume":"14","author":"J. Seiferas","year":"1977","unstructured":"Seiferas, J. Techniques for separating space complexity classes.Journal of Computer and System Sciences, 14:73\u201399, 1977.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02090765_CR32","unstructured":"Sistla, A. and German, S. Reasoning with many processes.Proceedings of the IEEE Symposium on Logic in Computer Science, pp. 138\u2013152, 1987."},{"issue":"4","key":"BF02090765_CR33","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/TCOM.1980.1094687","volume":"28","author":"P. Zafiropulo","year":"1980","unstructured":"Zafiropulo, P., West, C., Rudin, H., Cowan, D. and Brand, D. Towards analyzing and synthesizing protocols.IEEE Transactions on Communications, 28(4):651\u2013661, 1980.","journal-title":"IEEE Transactions on Communications"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02090765.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02090765\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02090765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T01:28:59Z","timestamp":1586395739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02090765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["BF02090765"],"URL":"https:\/\/doi.org\/10.1007\/bf02090765","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}