{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:48:19Z","timestamp":1784180899912,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540582014","type":"print"},{"value":"9783540485667","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_82","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:33:04Z","timestamp":1330270384000},"page":"364-375","source":"Crossref","is-referenced-by-count":17,"title":["Equivalences for fair Kripke structures"],"prefix":"10.1007","author":[{"given":"Adnan","family":"Aziz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vigyan","family":"Singhal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Felice","family":"Balarin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert K.","family":"Brayton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto L.","family":"Sangiovanni-Vincentelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"30_CR1","volume-title":"Technical Report UCB\/ERL M93\/68","author":"A. Aziz","year":"1993","unstructured":"A. Aziz, V. Singhal, G. M. Swamy, and R. K. Brayton. Minimizing Interacting Finite State Machines. Technical Report UCB\/ERL M93\/68, Electronics Research Lab, Univ. of California, Berkeley, CA 94720, September 1993."},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","volume":"59","author":"M. C. Browne","year":"1988","unstructured":"M. C. Browne, E. M. Clarke, and O. Gr\u00fcmberg. Characterizing Finite Kripke Structures in Propositional Temporal Logic. Theoretical Computer Science, 59:115\u2013131, 1988.","journal-title":"Theoretical Computer Science"},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1098\/rsta.1992.0028","volume":"339","author":"E. M. Clarke","year":"1992","unstructured":"E. M. Clarke, J. R. Burch, O. Gr\u00fcmberg, D. E. Long, and K. L. McMillan. Automatic Verification of Sequential Circuit Designs. Phil. Trans. of the Royal Society of London, 339:105\u2013120, 1992.","journal-title":"Phil. Trans. of the Royal Society of London"},{"issue":"2","key":"30_CR4","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 8(2):244\u2013263, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"E. A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 996\u20131072. Elsevier Science, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"issue":"1","key":"30_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E. A. Emerson","year":"1986","unstructured":"E. A. Emerson and J. Y. Halpern. \u201cSometimes\u201d and \u201cNot Never\u201d Revisited: on Branching versus Linear Time Temporal Logic. Journal of the ACM, 33(1):151\u2013178, 1986.","journal-title":"Journal of the ACM"},{"key":"30_CR7","volume-title":"PhD thesis","author":"Robert J. J. Glabbeek van","year":"1990","unstructured":"Robert J. van Glabbeek. Comparative Concurrency Sematics and Refinement of Actions. PhD thesis, Centrum voor Wiskunde en Informatica, Vrije Universiteit te Amsterdam, Amsterdam, May 1990."},{"key":"30_CR8","volume-title":"PhD thesis","author":"S. Safra","year":"1989","unstructured":"Shmuel Safra. Complexity of Automata on Infinite Objects. PhD thesis, The Weizmann Institute of Science, Rehovot, Israel, March 1989."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:31Z","timestamp":1605647911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}