{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:04Z","timestamp":1725663664573},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544302"},{"type":"electronic","value":"9783540383574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54430-5_100","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:48:35Z","timestamp":1330210115000},"page":"361-375","source":"Crossref","is-referenced-by-count":4,"title":["Using truth-preserving reductions to improve the clarity of kripke-models"],"prefix":"10.1007","author":[{"given":"Roope","family":"Kaivola","sequence":"first","affiliation":[]},{"given":"Antti","family":"Valmari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"26_CR1","unstructured":"Aho, A.V. & Hopcroft, J.E. & Ullman, J.D.: The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","volume":"14","author":"T. Bolognesi","year":"1987","unstructured":"Bolognesi, T. & Brinksma, E.: Introduction to the ISO Specification language LOTOS in Computer Networks and ISDN Systems 14, 1987, pp. 25\u201359, also in The Formal Description Language LOTOS, North-Holland, 1989, pp. 23\u201373","journal-title":"Computer Networks and ISDN Systems"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-17660-8_60","volume-title":"TAPSOFT '87, vol. I","author":"M. C. Browne","year":"1987","unstructured":"Browne, M. C. & Clarke, E. M. & Gr\u00fcmberg, O.: Characterizing Kripke Structures in Temporal Logic, in Ehrig, H. & Kowalski, R. & Levi, G. & Montanari, U. (eds.): TAPSOFT '87, vol. I, Lecture Notes in Computer Science, vol. 249, Springer-Verlag, Berlin, 1987, pp. 256\u2013270"},{"issue":"2","key":"26_CR4","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"Clarke, E. M. & Emerson, E. A. & Sistla, A. P.: Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, in ACM Transactions on Programming Languages and Systems, vol. 8, no. 2, April 1986, pp. 244\u2013263","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, E. M. & Long, D. E. & McMillan, K. L.: Compositional Model Checking, in Proceedings of the Fourth IEEE Symposium on Logic in Computer Science, 1989, pp. 353\u2013362","DOI":"10.1109\/LICS.1989.39190"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-52148-8_3","volume-title":"Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems","author":"R. Cleaveland","year":"1990","unstructured":"Cleaveland, R. & Parrow, J. & Steffen, B.: The Concurrency Workbench, in Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407, Springer-Verlag, Berlin, 1990, pp.24\u201337"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Emerson, E. A. & Lei, C-L.: Modalities for Model Checking: Branching Time Strikes Back, in Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1984, pp. 84\u201396, also in Science of Computer Programming, vol. 8, no. 3, 1987, pp. 275\u2013306","DOI":"10.1016\/0167-6423(87)90036-0"},{"key":"26_CR8","unstructured":"Lamport, L.: What Good is Temporal Logic?, in Proceedings of the IFIP 9th World Computer Congress, 1983, pp. 657\u2013668"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Lichtenstein. O, & Pnueli, A.: Checking That Finite State Concurrent Programs Satisfy Their Linear Specification, in Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985, pp. 97\u2013107","DOI":"10.1145\/318593.318622"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Stirling, C. & Walker, D.: CCS, Liveness and Local Model Checking in the Linear Time mu-Calculus, in Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, June 12\u201314, 1989","DOI":"10.1007\/3-540-52148-8_14"},{"key":"26_CR11","unstructured":"Valmari, A. & Tienari, M.: An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm, to appear in Proceedings of the 11th International IFIP WG 6.1 Symposium on Protocol Specification, Testing and Verification, Stockholm, June 17\u201320, 1991, 16 p."}],"container-title":["Lecture Notes in Computer Science","CONCUR '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54430-5_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:21:53Z","timestamp":1619572913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}