{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:22:45Z","timestamp":1778296965623,"version":"3.51.4"},"publisher-location":"London","reference-count":33,"publisher":"Springer London","isbn-type":[{"value":"9783540199823","type":"print"},{"value":"9781447130789","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/978-1-4471-3078-9_22","type":"book-chapter","created":{"date-parts":[[2011,12,12]],"date-time":"2011-12-12T02:47:45Z","timestamp":1323658065000},"page":"326-340","source":"Crossref","is-referenced-by-count":19,"title":["Failure-based Equivalences Are Faster Than Many Believe"],"prefix":"10.1007","author":[{"given":"Antti","family":"Valmari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","first-page":"228","volume-title":"CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing","author":"PC Kanellakis","year":"1983","unstructured":"Kanellakis, P. C. & Smolka, S. A.: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing, Montreal, Canada, August 1983, pp. 228\u2013240."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"PC Kanellakis","year":"1990","unstructured":"Kanellakis, P. C. & Smolka, S. A.: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation 86 (1990) pp. 43\u201368.","journal-title":"Information and Computation"},{"key":"22_CR3","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall 1989, 260 p."},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S. D., Hoare, C. A. R. & Roscoe, A. W.: A Theory of Communicating Sequential Processes. Journal of the ACM, 31 (3) 1984, pp. 560\u2013599.","journal-title":"Journal of the ACM"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Brookes, S. D. & Rounds, W. C.: Behavioural Equivalence Relationships Induced by Programming Logics. Proceedings of 10th International Conference on Automata, Languages, and Programming, Barcelona, Spain, Lecture Notes in Computer Science 154, Springer-Verlag 1983, pp. 97\u2013108.","DOI":"10.1007\/BFb0036900"},{"issue":"90","key":"22_CR6","first-page":"219","volume":"13","author":"J.-C. Fernandez","year":"1989","unstructured":"Fernandez, J.-C.: An Implementation of an Efficient Algorithm for Bisimulation Equivalence. Science of Computer Programming 13 (1989\/90) 219\u2013236.","journal-title":"Science of Computer Programming"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/BF01933173","volume":"31","author":"J Eloranta","year":"1991","unstructured":"Eloranta, J.: Minimizing the Number of Transitions with Respect to Observation Equivalence. BIT 31 (1991), 576\u2013590.","journal-title":"Bit"},{"key":"22_CR8","first-page":"158","volume":"45","author":"P Inverardi","year":"1991","unstructured":"Inverardi, P. & Priami, C.: Evaluation of Tools for the Analysis of Communicating Systems. EATCS Bulletin 45, October 1991, pp. 158\u2013185.","journal-title":"EATCS Bulletin"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Fernandez, J.-C. & Halbwachs, N.: Minimal Model Generation. Computer-Aided Verification \u201990 (Proceedings of a Workshop), AMS-ACM DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 3, American Mathematical Society 1991, pp. 85\u201391.","DOI":"10.1090\/dimacs\/003\/08"},{"key":"22_CR10","first-page":"57","volume-title":"Alleviating State Explosion during Verification of Behavioural Equivalence. Department of Computer Science, University of Helsinki, Report A- 1992-4","author":"A Valmari","year":"1992","unstructured":"Valmari, A.: Alleviating State Explosion during Verification of Behavioural Equivalence. Department of Computer Science, University of Helsinki, Report A- 1992-4, Helsinki, Finland 1992, 57 p."},{"key":"22_CR11","unstructured":"Brinksma, E.: A Theory for the Derivation of Tests. Protocol Specification, Test-ing and Verification VIII (Proceedings of International IFIP WG 6.1 Symposium, 1988), North-Holland 1988, pp. 63\u201374."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF00121128","volume":"1","author":"C Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Vardi, M., Wolper, P. & Yannakakis, M.: Memory Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in Sys-tem Design, 1: 275\u2013288 (1992).","journal-title":"Formal Methods in Sys-tem Design"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Valmari, A.: On-the-fly Verification with Stubborn Sets. Proceedings of CAV\u201993, 5th International Conference on Computer-Aided Verification, Elounda, Greece, Lecture Notes in Computer Science 697, Springer-Verlag 1993, pp. 397\u2013408.","DOI":"10.1007\/3-540-56922-7_33"},{"key":"22_CR14","unstructured":"Madelaine, E. & Vergamini, D.: AUTO: A Verification Tool for Distributed Systems Using Reduction of Finite Automata Networks. Formal Description Techniques II (Proceedings of FORTE \u201989), North-Holland 1990, pp. 61\u201366."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Graf, S. & Steffen, B.: Compositional Minimization of Finite State Processes. Computer-Aided Verification \u201990 (Proceedings of a workshop), AMS-ACM DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 3, American Mathematical Society 1991, pp. 57\u201373.","DOI":"10.1090\/dimacs\/003\/06"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Valmari, A.: Compositional State Space Generation. Advances in Petri Nets 1993, Lecture Notes in Computer Science 674, Springer-Verlag 1993, pp. 427\u2013457.","DOI":"10.1007\/3-540-56689-9_54"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0020-0190(85)90033-X","volume":"21","author":"T R\u00e4uchle","year":"1985","unstructured":"R\u00e4uchle, T. & Toueg, S.: Exposure to Deadlock for Communicating Processes is Hard to Detect. Information Processing Letters 21 (1985) pp. 63\u201368.","journal-title":"Information Processing Letters"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"ND Jones","year":"1977","unstructured":"Jones, N. D., Landweber, L. H. & Lien, Y. E.: Complexity of Some Problems in Petri Nets. Theoretical Computer Science 4 (1977) pp. 277\u2013299.","journal-title":"Theoretical Computer Science"},{"key":"22_CR19","first-page":"34","volume":"4","author":"A Valmari","year":"1988","unstructured":"Valmari, A.: Some Polynomial Space Complete Concurrency Problems. Tampere University of Technology, Software Systems Laboratory, Report 4, 1988, 34 p.","journal-title":"Report"},{"key":"22_CR20","first-page":"418","volume-title":"Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J. E. & Ullman, J. D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley 1979, 418 p."},{"key":"22_CR21","first-page":"3","volume-title":"An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm. Protocol Specification","author":"A Valmari","year":"1991","unstructured":"Valmari, A. & Tienari, M.: An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm. Protocol Specification, Testing and Verification XI, North-Holland 1991, pp. 3\u201318."},{"key":"22_CR22","first-page":"162","volume-title":"Minimal Transition Systems with Respect to Divergence Preserving Behavioural Equivalences. Doctoral thesis, University of Helsinki, Department of Computer Science, Report A-1994-1","author":"J Eloranta","year":"1994","unstructured":"Eloranta, J.: Minimal Transition Systems with Respect to Divergence Preserving Behavioural Equivalences. Doctoral thesis, University of Helsinki, Department of Computer Science, Report A-1994-1, Helsinki, Finland 1994, 162 p."},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Rabinovich, A.: Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract). Proceedings of ICALP 92, Lecture Notes in Computer Science 623, Springer-Verlag 1992, pp. 696\u2013707.","DOI":"10.1007\/3-540-55719-9_115"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Parrow, J. & Steffen, B.: The Concurrency Workbench. Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems, Lecture Notes in Computer Science 407, Springer-Verlag 1990, pp. 24\u201337.","DOI":"10.1007\/3-540-52148-8_3"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Valmari, A., Kemppainen, J., Clegg, M. & Levanto, M.: Putting Advanced Reachability Analysis Techniques Together: the \u201cARA\u201d Tool. Proceedings of Formal Methods Europe \u201993, Lecture Notes in Computer Science 670, Springer-Verlag 1993, pp. 597\u2013616.","DOI":"10.1007\/BFb0024669"},{"key":"22_CR26","first-page":"23","volume-title":"Introduction to the ISO Specification Language LOTOS. Computer Networks and ISDN Systems 14, 1987, pp. 25\u201359. Also in","author":"T Bolognesi","year":"1989","unstructured":"Bolognesi, T. & Brinksma, E.: Introduction to the ISO Specification Language LOTOS. Computer Networks and ISDN Systems 14, 1987, pp. 25\u201359. Also in: The Formal Description Technique LOTOS, North-Holland 1989, pp. 23\u201373."},{"key":"22_CR27","unstructured":"Valmari, A. & Tienari, M.: Compositional Failure-Based Semantic Models for Basic LOTOS. To appear in Formal Aspects of Computing, 29 p."},{"key":"22_CR28","unstructured":"Valmari, A.: The Weakest Deadlock-Preserving Congruence. To appear in Infor-mation Processing Letters."},{"key":"22_CR29","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall 1985, 256 p."},{"key":"22_CR30","first-page":"77","volume-title":"Failures without Chaos: A New Process Semantics for Fair Abstraction","author":"JA Bergstra","year":"1987","unstructured":"Bergstra, J. A., Klop, J. W. & Olderog, E.-R.: Failures without Chaos: A New Process Semantics for Fair Abstraction. Formal Description of Programming Concepts III, North-Holland, 1987, pp. 77\u2013103."},{"key":"22_CR31","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Sys-tems","author":"Z Manna","year":"1992","unstructured":"Manna, Z. & Pnueli, A.: The Temporal Logic of Reactive and Concurrent Sys-tems: Specification. Springer-Verlag 1992, 427 p."},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Kaivola, R. & Valmari, A.: The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic. Proceedings of CONCUR \u201992, Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 207\u2013221.","DOI":"10.1007\/BFb0084793"},{"key":"22_CR33","first-page":"15","volume-title":"Validation and Verification with Weak Process Semantics. Proceedings of Nordic Seminar on Dependable Computing Systems 1994","author":"M Set\u00e4l\u00e4","year":"1994","unstructured":"Set\u00e4l\u00e4, M. & Valmari, A.: Validation and Verification with Weak Process Semantics. Proceedings of Nordic Seminar on Dependable Computing Systems 1994, Lyngby, Denmark, August 1994, pp. 15\u201326."}],"container-title":["Workshops in Computing","Structures in Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3078-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T19:17:50Z","timestamp":1561058270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3078-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540199823","9781447130789"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3078-9_22","relation":{},"ISSN":["1431-1682"],"issn-type":[{"value":"1431-1682","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]}}}