{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:08Z","timestamp":1725663668551},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544302"},{"type":"electronic","value":"9783540383574"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54430-5_111","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:48:56Z","timestamp":1330192136000},"page":"526-540","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Reduced labelled transition systems save verification effort"],"prefix":"10.1007","author":[{"given":"Antti","family":"Valmari","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Clegg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"37_CR1","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. Computer Networks and ISDN Systems 14 (1987) 25\u201359. Also: The Formal Description Technique LOTOS, North-Holland 1989, pp. 23\u201373.","journal-title":"Computer Networks and ISDN Systems"},{"key":"37_CR2","unstructured":"Bolognesi, T. & Smolka, S. A.: Fundamental Results for the Verification of Observational Equivalence: A Survey. Protocol Specification, Testing and Verification VII, North-Holland, 1987, pp. 165\u2013179."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Clarke, E. M. & Gr\u00fcmberg, O.: Avoiding the State Explosion Problem in Temporal Logic Model Checking Algorithms. Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, 1987, pp. 294\u2013303.","DOI":"10.1145\/41840.41865"},{"key":"37_CR4","unstructured":"Clarke, E. M., Long, D. E. & McMillan, K. L.: Compositional Model Checking. Proceedings of the Fourth IEEE Symposium of Logic in Computer Science, Asilomar, California, 1989."},{"key":"37_CR5","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-52148-8_3","volume":"407","author":"R. Cleaveland","year":"1990","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.","journal-title":"Lecture Notes in Computer Science"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Using Partial Orders to Improve Automatic Verification Methods. Proceedings of the Workshop on Computer-Aided Verification, DIMACS Technical Report 90\u201331, Vol. I, 1990.","DOI":"10.1090\/dimacs\/003\/21"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Godefroid, P. & Wolper, P.: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. To appear in the Proceedings of the Third Workshop on Computer Aided Verification, Aalborg, Denmark, July 1991.","DOI":"10.1007\/3-540-55179-4_32"},{"key":"37_CR8","unstructured":"Graf, S. & Steffen, B.: Compositional Minimization of Finite State Processes. Proceedings of the Workshop on Computer-Aided Verification, DIMACS Technical Report 90-31, Vol. I, 1990."},{"key":"37_CR9","unstructured":"Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall 1985, 256 p."},{"key":"37_CR10","unstructured":"Itoh, M. & Ichikawa, H.: Protocol Verification Algorithm Using Reduced Reachability Analysis. Transactions of the IECE of Japan E66 Nr 2 1983 pp. 88\u201393."},{"key":"37_CR11","unstructured":"Janicki, R. & Koutny, M.: Net Implementation of Optimal Simulations. Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris 1990, pp. 295\u2013314."},{"key":"37_CR12","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/978-3-540-47919-2_10","volume":"254","author":"K. Jensen","year":"1987","unstructured":"Jensen, K.: Coloured Petri Nets. Petri Nets, Central Models and Their Properties, Lecture Notes in Computer Science 254, Springer-Verlag 1987, pp. 248\u2013299.","journal-title":"Lecture Notes in Computer Science"},{"key":"37_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R. M. Karp","year":"1969","unstructured":"Karp, R. M. & Miller, R. E.: Parallel Program Schemata. Journal of Computer and System Sciences 3 (1969) pp. 147\u2013195.","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR14","unstructured":"Lindqvist, M.: Parameterized Reachability Trees for Predicate\/Transition Nets. Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris 1990, pp. 22\u201342."},{"key":"37_CR15","first-page":"279","volume":"255","author":"A. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace Theory. Petri Nets, Applications and Relationships to Other Models of Concurrency, Lecture Notes in Computer Science 255, Springer-Verlag 1987, pp. 279\u2013324.","journal-title":"Lecture Notes in Computer Science"},{"key":"37_CR16","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall 1989, 260 p."},{"key":"37_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E.-R. Olderog","year":"1986","unstructured":"Olderog, E.-R. & Hoare, C. A. R.: Specification-Oriented Semantics for Communicating Processes. Acta Informatica 23, 1986, pp. 9\u201366.","journal-title":"Acta Informatica"},{"key":"37_CR18","unstructured":"Overman, W. T.: Verification of Concurrent Systems: Function and Timing. PhD Thesis, University of California Los Angeles 1981, 174 p."},{"key":"37_CR19","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1007\/BFb0027047","volume":"224","author":"A. Pnueli","year":"1986","unstructured":"Pnueli, A.: Applications of Temporal Logic to the Specification and Verification of Concurrent Systems: A Survey of Current Trends. Current Trends in Concurrency, Lecture Notes in Computer Science 224, Springer-Verlag 1986, pp. 510\u2013584.","journal-title":"Lecture Notes in Computer Science"},{"key":"37_CR20","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/3-540-52148-8_25","volume":"407","author":"J. Quemada","year":"1990","unstructured":"Quemada, J., Pav\u00f3n, S. & Fern\u00e1ndez, A.: State Exploration by Transformation with LOLA. Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407, Springer-Verlag 1990, pp. 294\u2013302.","journal-title":"Lecture Notes in Computer Science"},{"key":"37_CR21","unstructured":"Valmari, A.: Error Detection by Reduced Reachability Graph Generation. Proceedings of the Ninth European Workshop on Application and Theory of Petri Nets, Venice, Italy 1988, pp. 95\u2013112."},{"key":"37_CR22","first-page":"640","volume":"2","author":"A. Valmari","year":"1988","unstructured":"Valmari, A.: Heuristics for Lazy State Generation Speeds up Analysis of Concurrent Systems. Proceedings of the Finnish Artificial Intelligence Symposium STeP-88, Helsinki 1988, Vol. 2 pp. 640\u2013650.","journal-title":"Helsinki"},{"key":"37_CR23","unstructured":"Valmari, A.: State Space Generation: Efficiency and Practicality. PhD Thesis, Tampere University of Technology Publications 55, 1988, 169 p."},{"key":"37_CR24","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-51285-3_35","volume":"366","author":"A. Valmari","year":"1989","unstructured":"Valmari, A.: Eliminating Redundant Interleavings during Concurrent Program Verification. Proceedings of Parallel Architectures and Languages Europe '89 Vol. 2, Lecture Notes in Computer Science 366, Springer-Verlag 1989 pp. 89\u2013103.","journal-title":"Lecture Notes in Computer Science"},{"key":"37_CR25","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume":"483","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn Sets for Reduced State Space Generation. Advances in Petri Nets 1990, Lecture Notes in Computer Science 483, Springer-Verlag 1991, pp. 491\u2013515. (An earlier version appeared in Proceedings of the 10th International Conference on Application and Theory of Petri Nets, Bonn 1989, Vol. 2 pp. 1\u201322.)","journal-title":"Lecture Notes in Computer Science"},{"key":"37_CR26","unstructured":"Valmari, A.: State Space Generation with Induction (Short Version). Scandinavian Conference on Artificial Intelligence-89, Frontiers in Artificial Intelligence and Applications, IOS, Amsterdam 1989, pp. 99\u2013115."},{"key":"37_CR27","doi-asserted-by":"crossref","unstructured":"Valmari, A.: A Stubborn Attack on State Explosion. Computer-Aided Verification '90, AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol 3, pp. 25\u201341. Also in Proceedings of the Workshop on Computer-Aided Verification, DIMACS Technical Report 90-31, Vol. I, 1990.","DOI":"10.1090\/dimacs\/003\/04"},{"key":"37_CR28","unstructured":"Valmari, A.: Compositional State Space Generation. Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris 1990, pp. 43\u201362."},{"key":"37_CR29","unstructured":"Valmari, A.: Stubborn Sets of Coloured Petri Nets. To appear in the Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Aarhus, Denmark 1991. 20 p."},{"key":"37_CR30","unstructured":"Valmari, A. & Tienari, M.: An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm. To appear in the proceedings of the 11th International IFIP WG 6.1 Symposium on Protocol Specification, Testing and Verification 1991, Stockholm, Sweden, June 1991. 16 p."},{"key":"37_CR31","unstructured":"Vuong, S. T., Hui, D. D. & Cowan, D. D.: Valira \u2014 A Tool for Protocol Validation via Reachability Analysis. Protocol Specification, Testing and Verification VI, North-Holland 1987, pp. 35\u201341."}],"container-title":["Lecture Notes in Computer Science","CONCUR '91"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54430-5_111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:36:00Z","timestamp":1558254960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_111","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}