{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:55:21Z","timestamp":1648907721766},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1007\/bf01178682","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T16:37:46Z","timestamp":1108658266000},"page":"681-692","source":"Crossref","is-referenced-by-count":2,"title":["Priority systems with many identical processes"],"prefix":"10.1007","volume":"28","author":[{"given":"Hsu-Chun","family":"Yen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. Clarke","year":"1986","unstructured":"Clarke, E., Emerson, E., Sistla, A.: Automatic verification of finite state concurrent programs from temporal specifications. ACM Trans. Program. Lang. Systems8, 244?263 (1986)","journal-title":"Program. Lang. Systems"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Clarke, E., Grumberg, O., Browne, M.: Reasoning about networks with many identical finite-state processes. Proceedings of 5th ACM Symposium on Principles of Distributed Computing, pp. 240?248, 1986","DOI":"10.1145\/10590.10611"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Garg, V.: Analysis of distributed systems with many identical processes. IEEE International Conference on Distributed Computing Systems, pp. 358?365, 1988","DOI":"10.1109\/DCS.1988.12537"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/0214042","volume":"14","author":"M. Gouda","year":"1985","unstructured":"Gouda, M., Rosier, L.: Priority networks of communicating finite state machines. SIAM J. Comput.14, 157?166 (1985)","journal-title":"SIAM J. Comput."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"N. Jones","year":"1977","unstructured":"Jones, N., Laaser, W.: Complete problems for deterministic polynomial time. Theoret. Comput. Sci.3, 105?117 (1977)","journal-title":"Theoret. Comput. Sci."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. Proceedings 18th Annual Symposium on Foundations of Computer Science, pp. 254?266, 1977","DOI":"10.1109\/SFCS.1977.16"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification. Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages, pp. 97?107, 1985","DOI":"10.1145\/318593.318622"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: Specification and verification of concurrent programs by ?-automata. Proceedings of 13th ACM Symposium on Principles of Programming Languages, pp. 1?12, 1987","DOI":"10.1145\/41625.41626"},{"key":"CR9","volume-title":"Computation: Finite and infinite machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and infinite machines. Englewood Cliffs, NJ: Prentice Hall 1967"},{"key":"CR10","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., Yen, H.: On the complexity of deciding fair termination of probabilistic concurrent finite-state programs. Theoret. Comput. Sci.58, 263?324 (1988)","journal-title":"Theoret. Comput. Sci."},{"key":"CR11","unstructured":"Sistla, A., German, S.: Reasoning with many processes. Proceedings of IEEE Symposium on Logic in Computer Science, pp. 138?152, 1987"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pp. 327?338, 1985","DOI":"10.1109\/SFCS.1985.12"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178682.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01178682\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T09:07:54Z","timestamp":1556615274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01178682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":12,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["BF01178682"],"URL":"https:\/\/doi.org\/10.1007\/bf01178682","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}