{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T02:27:14Z","timestamp":1784255234739,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540638766","type":"print"},{"value":"9783540696599","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0058037","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T06:48:04Z","timestamp":1154587684000},"page":"284-296","source":"Crossref","is-referenced-by-count":37,"title":["A simple characterization of stuttering bisimulation"],"prefix":"10.1007","author":[{"given":"Kedar S.","family":"Namjoshi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K. R., Olderog, E-R. Verification of Sequential and Concurrent Programs, Springer-Verlag, 1991.","DOI":"10.1007\/978-1-4757-4376-0"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","volume":"59","author":"M. C. Browne","year":"1988","unstructured":"Browne, M. C., Clarke, E. M., Grumberg, O. Characterizing Finite Kripke Structures in Propositional Temporal Logic, Theor. Comp. Sci., vol. 59, pp. 115\u2013131, 1988.","journal-title":"Theor. Comp. Sci."},{"issue":"no.1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0890-5401(89)90026-6","volume":"81","author":"M. C. Browne","year":"1989","unstructured":"Browne, M. C., Clarke, E. M., Grumberg, O. Reasoning about Networks with Many Identical Finite State Processes, Information and Computation, vol. 81, no. 1, pp. 13\u201331, April 1989.","journal-title":"Information and Computation"},{"key":"20_CR4","unstructured":"Clarke, E.M., Filkorn, T., Jha, S. Exploiting Symmetry in Temporal Logic Model Checking, 5th CAV, Springer-Verlag LNCS 697."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Emerson, E. A., Halpern, J. Y. \u201cSometimes\u201d and \u201cNot Never\u201d Revisited: On Branching versus Linear Time Temporal Logic. in POPL, 1982.","DOI":"10.1145\/567067.567081"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Namjoshi, K.S. Reasoning about Rings. in POPL, 1995.","DOI":"10.1145\/199448.199468"},{"key":"20_CR7","unstructured":"Emerson, E.A., Sistla, A.P. Symmetry and Model Checking, 5th CAV, Springer-Verlag LNCS 697."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Francez, N. Fairness, Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"20_CR9","volume-title":"Information Processing 89","author":"R. J. Glabbeek van","year":"1989","unstructured":"van Glabbeek, R. J., Weijland, W. P. Branching time and abstraction in bisimulation semantics. in Information Processing 89, Elsevier Science Publishers, North-Holland, 1989."},{"key":"20_CR10","unstructured":"Grumberg, O., Francez, N., Makowski, J., de Roever, W-P. A proof rule for fair termination, in Information and Control, 1983."},{"key":"20_CR11","unstructured":"Klarlund, N., Kozen, D. Rabin measures and their applications to fairness and automata theory. in LICS, 1991."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Lamport, L. \u201cSometimes\u201d is Sometimes \u201cNot Never\u201d, in POPL, 1980.","DOI":"10.1145\/567446.567463"},{"key":"20_CR13","unstructured":"Milner, R. Communication and Concurrency, Prentice-Hall International Series in Computer Science. Edited by C.A.R. Hoare."},{"issue":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R. Nicola de","year":"1995","unstructured":"de Nicola, R., Vaandrager, F. Three logics for branching bisimulation. in LICS, 1990. Full version in Journal of the ACM, 42(2):458\u2013487, 1995.","journal-title":"Journal of the ACM"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0168-0072(91)90066-U","volume":"51","author":"M. Vardi","year":"1991","unstructured":"Vardi, M. Verification of Concurrent Programs \u2014 The Automata Theoretic Framework. in LICS, 1987. Full version in Annals of Pure and Applied Logic, 51:79\u201398, 1991.","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0058037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T10:03:21Z","timestamp":1555754601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0058037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638766","9783540696599"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0058037","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}