{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:33Z","timestamp":1725488613629},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672821"},{"type":"electronic","value":"9783540464198"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46419-0_20","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T23:17:25Z","timestamp":1186615045000},"page":"283-298","source":"Crossref","is-referenced-by-count":4,"title":["Checking for CFFD-Preorder with Tester Processes"],"prefix":"10.1007","author":[{"given":"Juhana","family":"Helovuo","sequence":"first","affiliation":[]},{"given":"Antti","family":"Valmari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"20_CR1","unstructured":"E. Brinksma, G. Scollo, and C. Steenbergen. LOTOS specifications, their implementations and their tests. Protocol Specification, Testing and Verification VI, IFIP 1987, pages 349\u2013360, 1987. 284"},{"key":"20_CR2","unstructured":"Ed Brinksma. A theory for the derivation of tests. In Protocol Specification, Testing and Verification VIII, pages 63\u201374. North-Holland, 1989. 284, 291"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01211314","volume":"5","author":"R. Cleaveland","year":"1993","unstructured":"Rance Cleaveland and Matthew Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5(1):1\u201320, 1993. 284","journal-title":"Formal Aspects of Computing"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy. Acceptance trees. Journal of the ACM 32(4), pages 896\u2013928, 1985. 290","journal-title":"Journal of the ACM"},{"key":"20_CR5","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985. 283, 285"},{"key":"20_CR6","unstructured":"Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1990. 291, 296"},{"key":"20_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0084793","volume-title":"CONCUR\u2019 92: Third International Conference on Concurrency Theory","author":"R. Kaivola","year":"1992","unstructured":"Roope Kaivola and Antti Valmari. The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In CONCUR\u2019 92: Third International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 207\u2013221. Springer-Verlag. 284"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. C. Kanellakis","year":"1990","unstructured":"Paris C. Kanellakis and Scott A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43\u201368, May 1990. 288","journal-title":"Information and Computation"},{"key":"20_CR9","unstructured":"Guy Leduc. On the Role of Implementation Relations in the Design of Distrubuted Systems using LOTOS. PhD thesis, Universit\u00e9 de Li\u00e8ge, July 1990. 283"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems-Specification. Springer-Verlag, 1992. 284","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"20_CR11","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989. 283"},{"key":"20_CR12","series-title":"Lect Notes Comput Sci","first-page":"441","volume-title":"Petri Nets: Applications an Relationships to Other Models of Concurrency","author":"E.-R. Olderog","year":"1986","unstructured":"Ernst-R\u00fcdiger Olderog. TCSP: Theory of communicating sequential processes. In Petri Nets: Applications an Relationships to Other Models of Concurrency, volume 255 of Lecture Notes in Computer Science, pages 441\u2013465. Springer-Verlag, July 1986. 287"},{"key":"20_CR13","unstructured":"A. W. Roscoe. Model-checking CSP. In A Classical Mind: Essays in Honour of C. A. R. Hoare, pages 353\u2013378. Prentice-Hall, 1994. 284, 285"},{"key":"20_CR14","unstructured":"A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1998. 283, 284, 285"},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-61363-3_3","volume":"1091","author":"A. Valmari","year":"1996","unstructured":"A. Valmari. Compositionality in state space verification methods. In Application and Theory of Petri Nets 1996, 17th International Conference, volume 1091, pages 29\u201356, 1996. 287","journal-title":"Application and Theory of Petri Nets 1996, 17th International Conference"},{"key":"20_CR16","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","volume":"1491","author":"A. Valmari","year":"1998","unstructured":"A. Valmari. The state explosion problem. In Lectures on Petri Nets I: Basic Models, volume 1491, pages 429\u2013528, 1998. 284, 291","journal-title":"Lectures on Petri Nets I: Basic Models"},{"key":"20_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BFb0024669","volume-title":"FME\u201993: Industrial-Strength Formal Methods","author":"A. Valmari","year":"1993","unstructured":"Antti Valmari, Jukka Kemppainen, Matthew Clegg, and Mikko Levanto. Putting advanced reachability analysis techniques together: the \u201cARA\u201d tool. In FME\u201993: Industrial-Strength Formal Methods, pages 597\u2013616. Formal Methods Europe, Springer-Verlag, April 1993. Lecture Notes in Computer Science 670. 285, 296"},{"key":"20_CR18","unstructured":"Antti Valmari and Martti Tienari. An improved failures equivalence for finite-state systems with a reduction algorithm. In Proceedings of the IFIP WG 6.1 Eleventh International Symposium on Protocol Specification, Testing and Verification, Stockholm, Sweden, pages 3\u201318. North-Holland, 1991. 283, 285, 290, 293"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BF01211218","volume":"7","author":"A. Valmari","year":"1995","unstructured":"Antti Valmari and Martti Tienari. Compositional failure-based semantic models for Basic LOTOS. Formal Aspects of Computing, 7:440\u2013468, 1995. 283, 285, 287, 288","journal-title":"Formal Aspects of Computing"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Valmari, A. On-the-fly verification with stubborn sets. In Proc. of the 1993 Workshop on Computer-Aided Verification, 1993. 291, 296","DOI":"10.1007\/3-540-56922-7_33"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46419-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T03:43:39Z","timestamp":1550720619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46419-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672821","9783540464198"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-46419-0_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}