{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:53Z","timestamp":1725664613845},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602224"},{"type":"electronic","value":"9783540447542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60222-4_95","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:54:45Z","timestamp":1330260885000},"page":"36-50","source":"Crossref","is-referenced-by-count":8,"title":["An efficient verifier of truly concurrent properties"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Bianchi","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Coluccini","sequence":"additional","affiliation":[]},{"given":"Pierpaolo","family":"Degano","sequence":"additional","affiliation":[]},{"given":"Corrado","family":"Priami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3233\/FI-1988-11406","volume":"XI","author":"G. Boudol","year":"1988","unstructured":"G. Boudol and I. Castellani. A non-interleaving semantics for CCS based on proved transitions. Foundamenta Informaticae, XI(4):433\u2013452, 1988.","journal-title":"Foundamenta Informaticae"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. In Proceedings of CONCUR'92, LNCS 630, pages 108\u2013122. Springer-Verlag, 1992.","DOI":"10.1007\/BFb0084786"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transaction on Programming Languages and Systems, pages 36\u201372, 1993.","DOI":"10.1145\/151646.151648"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"M. Clegg and A. Valmari. Reduced labelled transition systems save verification effort. In Proceedings of CONCUR'91, LNCS 527. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54430-5_111"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Ph. Darondeau and P. Degano. Causal trees. In Proceedings of ICALF'89, LNCS 372, pages 234\u2013248. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0035764"},{"key":"5_CR6","volume-title":"Technical Report 111","author":"R. Simone de","year":"1989","unstructured":"R. de Simone and D. Vergamini. Aboard AUTO. Technical Report 111, INRIA Sophia-Antipolis, 1989."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"P. Degano, R. De Nicola, and U. Montanari. Partial ordering derivations for CCS. In Proceedings of FCT, LNCS 199, pages 520\u2013533. Springer-Verlag, 1985.","DOI":"10.1007\/BFb0028836"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"P. Degano and C. Priami. Proved trees. In Proceedings of ICALP'92, LNCS 623, pages 629\u2013640. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55719-9_110"},{"key":"5_CR9","unstructured":"P. Degano and C. Priami. A compact representation of finite-state processes. Technical Report LOMAPSDIPISA2, LOMAPS Project, 1993."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"P. Degano and C. Priami. Causality for mobile processes. In Proceedings of ICALP'95, LNCS. Springer-Verlag, 1995. To appear.","DOI":"10.1007\/3-540-60084-1_113"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. In Proceedings of CAV'91, LNCS 575, pages 332\u2013342. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-55179-4_32"},{"key":"5_CR12","volume-title":"Technical report","author":"J.C. Godskesen","year":"1989","unstructured":"J.C. Godskesen, K.G. Larsen, and M. Zeeberg. TAV users manual. Technical report, Aalborg University Center, Denmark, 1989."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"issue":"6","key":"5_CR14","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1007\/BF03259392","volume":"6","author":"P. Inverardi","year":"1994","unstructured":"P. Inverardi, C. Priami, and D. Yankelevich. Automatizing parametric reasoning on distributed concurrent systems. Formal Aspects of Computing, 6(6):676\u2013695, 1994.","journal-title":"Formal Aspects of Computing"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis and S. C. Smolka. CCS expressions, finite state processes and three problems of equivalence. In Proceedings of the Second ACM Symposium on Principles of Distributed Computing, 1983.","DOI":"10.1145\/800221.806724"},{"key":"5_CR16","unstructured":"A. Kiehn. Local and global causes. Technical report, TUM 342\/23\/91, 1991."},{"key":"5_CR17","unstructured":"X. Leroy and M. Mauny. The Caml Light System, Release 0.5. Documentation and User's Manual., 1992."},{"key":"5_CR18","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989."},{"issue":"6","key":"5_CR19","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Proceedings of GI, LNCS 104, pages 167\u2013183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"D. Peled. All from one, one from all: On model checking using representatives. In Proceedings of CAV'93, LNCS 697, pages 409\u2013423. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56922-7_34"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"C. Priami and D. Yankelevich. Read-write causality. In Proceedings of MFCS'94, LNCS 841, pages 567\u2013576. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58338-6_103"},{"key":"5_CR23","unstructured":"A. Valmari and M. Tienari. An improved failure equivalence for finite-state systems with a reduction algorithm. In Proceedings of IFIP WG6.1 Protocol Specification, Testing and Verification, Stockholm, June 1991."}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60222-4_95.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:32:46Z","timestamp":1640925166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60222-4_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602224","9783540447542"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-60222-4_95","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}