{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:09:13Z","timestamp":1754485753850},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581529"},{"type":"electronic","value":"9783540484622"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58152-9_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:20:30Z","timestamp":1330269630000},"page":"531-547","source":"Crossref","is-referenced-by-count":17,"title":["Compositional analysis with place-bordered subnets"],"prefix":"10.1007","author":[{"given":"Antti","family":"Valmari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Berthelot, G.: Transformations and Decompositions of Nets. In Petri Nets: Central Models and Their Properties, Lecture Notes in Computer Science 254, Springer-Verlag 1987, pp. 359\u2013376.","DOI":"10.1007\/978-3-540-47919-2_13"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Brookes, S. D. & Roscoe, A. W.: An Improved Failures Model for Communicating Sequential Processes. In: Proceedings of the NSF-SERC Seminar on Concurrency, Lecture Notes in Computer Science 197, Springer-Verlag 1985, pp. 281\u2013305.","DOI":"10.1007\/3-540-15670-4_14"},{"issue":"Nr5","key":"29_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/167049.167071","volume":"18","author":"S. C. Cheung","year":"1993","unstructured":"Cheung, S. C. & Kramer, J.: Enhancing Compositional Reachability Analysis with Context Constraints. Proceedings of ACM SIGSOFT '93: Symposium on the Foundations of Software Engineering, Los Angeles, USA, December 1993, ACM Software Engineering Notes Vol. 18 Nr 5, 1993, pp. 115\u2013125.","journal-title":"ACM Software Engineering Notes"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Finkel, A.: The Minimal Coverability Graph for Petri Nets. Advances in Petri Nets 1993, Lecture Notes in Computer Science 674, Springer-Verlag 1993, pp. 210\u2013243. (Earlier version in Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris, France 1990, pp. 1\u201321.)","DOI":"10.1007\/3-540-56689-9_45"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Graf, S. & Steffen, B.: Compositional Minimization of Finite State Processes. In: Computer-Aided Verification '90 (Proceedings of a workshop), AMS-ACM DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 3, American Mathematical Society 1991, pp. 57\u201373.","DOI":"10.1090\/dimacs\/003\/06"},{"key":"29_CR6","unstructured":"Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall 1985, 256 p."},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Jensen, K.: Coloured Petri Nets. In: Petri Nets: Central Models and Their Properties, Lecture Notes in Computer Science 254, Springer-Verlag 1987, pp. 248\u2013299.","DOI":"10.1007\/978-3-540-47919-2_10"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Kaivola, R. & Valmari, A.: The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic. Proceedings of CONCUR '92, Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 207\u2013221.","DOI":"10.1007\/BFb0084793"},{"key":"29_CR9","series-title":"Report C-1993-1","volume-title":"Licentiate Thesis","author":"R. Kaivola","year":"1993","unstructured":"Kaivola, R. Compositional Linear Temporal Logic Model-Checking for Concurrent Systems. Licentiate Thesis, University of Helsinki, Department of Computer Science, Report C-1993-1, Helsinki, Finland, 1993, 58 + 42 pp."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Lindqvist, M.: Parameterized Reachability Trees for Predicate\/Transition Nets. Advances in Petri Nets 1993, Lecture Notes in Computer Science 674, Springer-Verlag 1993, pp. 301\u2013324. (Earlier version in Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris, France 1990, pp. 22\u201342.)","DOI":"10.1007\/3-540-56689-9_49"},{"key":"29_CR11","doi-asserted-by":"crossref","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. (Earlier version in Proceedings of the 10th International Conference on Application and Theory of Petri Nets, Bonn, West Germany 1989, Vol II, pp. 1\u201322.)","DOI":"10.1007\/3-540-53863-1_36"},{"key":"29_CR12","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. (Earlier version in Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris, France 1990, pp. 43\u201362.)","DOI":"10.1007\/3-540-56689-9_54"},{"key":"29_CR13","unstructured":"Valmari, A. & Tienari, M.: An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm. In: Protocol Specification, Testing and Verification XI, North-Holland 1991, pp. 3\u201318."},{"key":"29_CR14","volume-title":"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":"29_CR15","doi-asserted-by":"crossref","unstructured":"Valmari, A., Kemppainen, J., Clegg, M. & Levante, M.: Putting Advanced Reachability Analysis Techniques Together: the \u201cARA\u201d Tool. Proceedings of Formal Methods Europe '93, Lecture Notes in Computer Science 670, Springer-Verlag 1993, pp. 597\u2013616.","DOI":"10.1007\/BFb0024669"},{"key":"29_CR16","volume-title":"Report 16","author":"A. Valmari","year":"1993","unstructured":"Valmari, A. & Tienari, M.: Compositional Failure-Based Semantic Models for Basic LOTOS. Tampere University of Technology, Software Systems Laboratory, Report 16, Tampere, Finland, July 1993, 25 p."},{"key":"29_CR17","unstructured":"Valmari, A. & Set\u00e4l\u00e4, M.: A Fast Reduction Algorithm for Failure-Based Semantics. Submitted for publication, 13 p."}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58152-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:17:27Z","timestamp":1605647847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58152-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581529","9783540484622"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-58152-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}