{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:37:50Z","timestamp":1742963870153,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035413"},{"type":"electronic","value":"9783319035420"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03542-0_1","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T16:31:54Z","timestamp":1386606714000},"page":"1-16","source":"Crossref","is-referenced-by-count":4,"title":["Brzozowski\u2019s and Up-To Algorithms for Must Testing"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Georgiana","family":"Caltais","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Pous","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12002-2_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P.A. Abdulla","year":"2010","unstructured":"Abdulla, P.A., Chen, Y.-F., Hol\u00edk, L., Mayr, R., Vojnar, T.: When simulation meets antichains. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 158\u2013174. Springer, Heidelberg (2010)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-32621-9_14","volume-title":"Logic, Language, Information and Computation","author":"N. Bezhanishvili","year":"2012","unstructured":"Bezhanishvili, N., Kupke, C., Panangaden, P.: Minimization via duality. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol.\u00a07456, pp. 191\u2013205. Springer, Heidelberg (2012)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.entcs.2012.08.006","volume":"286","author":"F. Bonchi","year":"2012","unstructured":"Bonchi, F., Bonsangue, M., Caltais, G., Rutten, J., Silva, A.: Final semantics for decorated traces. Elect. Not. in Theor. Comput. Sci.\u00a0286, 73\u201386 (2012)","journal-title":"Elect. Not. in Theor. Comput. Sci."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-29485-3_2","volume-title":"Logic and Program Semantics","author":"F. Bonchi","year":"2012","unstructured":"Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M., Silva, A.: Brzozowski\u2019s algorithm (Co)Algebraically. In: Constable, R.L., Silva, A. (eds.) Kozen Festschrift. LNCS, vol.\u00a07230, pp. 12\u201323. Springer, Heidelberg (2012)"},{"key":"1_CR5","unstructured":"Bonchi, F., Caltais, G., Pous, D., Silva, A.: Brzozowski\u2019s and up-to algorithms for must testing (full version), \n http:\/\/www.alexandrasilva.org\/files\/brz-hkc-must-full.pdf"},{"key":"1_CR6","unstructured":"Bonchi, F., Caltais, G., Pous, D., Silva, A.: Web appendix of this paper, with implementation of the algorithms (July 2013), \n http:\/\/perso.ens-lyon.fr\/damien.pous\/brz"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: POPL, pp. 457\u2013468. ACM (2013)","DOI":"10.1145\/2480359.2429124"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.tcs.2006.05.030","volume":"360","author":"M. Boreale","year":"2006","unstructured":"Boreale, M., Gadducci, F.: Processes as formal power series: a coinductive approach to denotational semantics. TCS\u00a0360(1), 440\u2013458 (2006)","journal-title":"TCS"},{"issue":"6","key":"1_CR9","first-page":"529","volume":"12","author":"J.A. Brzozowski","year":"1962","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata\u00a012(6), 529\u2013561 (1962)","journal-title":"Mathematical Theory of Automata"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-89287-8_4","volume-title":"Transactions on Petri Nets and Other Models of Concurrency I","author":"F. Calzolai","year":"2008","unstructured":"Calzolai, F., De Nicola, R., Loreti, M., Tiezzi, F.: TAPAs: A tool for the analysis of process algebras. In: Jensen, K., van der Aalst, W.M.P., Billington, J. (eds.) ToPNoC I. LNCS, vol.\u00a05100, pp. 54\u201370. Springer, Heidelberg (2008)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Cancila, D., Honsell, F., Lenisa, M.: Generalized coiteration schemata. Elect. Not. in Theor. Comput. Sci.\u00a082(1) (2003)","DOI":"10.1016\/S1571-0661(04)80633-9"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-52148-8_2","volume-title":"Automatic Verification Methods for Finite State Systems","author":"R. Cleaveland","year":"1990","unstructured":"Cleaveland, R., Hennessy, M.: Testing equivalence as a bisimulation equivalence. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 11\u201323. Springer, Heidelberg (1990)"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: The Concurrency Workbench: A semantics-based tool for the verification of concurrent systems. TOPLAS\u00a015(1), 36\u201372 (1993)","journal-title":"TOPLAS"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. De Nicola","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. TCS\u00a034, 83\u2013133 (1984)","journal-title":"TCS"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.: Real-reward testing for probabilistic processes. In: QAPL. EPTCS, vol.\u00a057, pp. 61\u201373 (2011)","DOI":"10.4204\/EPTCS.57.5"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing in a finite automaton. In: Proc. Int. Symp. of Theory of Machines and Computations, pp. 189\u2013196. Academic Press (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"1_CR17","first-page":"228","volume-title":"PODC 1983","author":"P.C. Kanellakis","year":"1983","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. In: PODC 1983, pp. 228\u2013240. ACM, New York (1983)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.entcs.2004.02.029","volume":"106","author":"B. Klin","year":"2004","unstructured":"Klin, B.: A coalgebraic approach to process equivalence and a coinduction principle for traces. Elect. Not. in Theor. Comput. Sci.\u00a0106, 201\u2013218 (2004)","journal-title":"Elect. Not. in Theor. Comput. Sci."},{"issue":"38","key":"1_CR19","doi-asserted-by":"publisher","first-page":"5043","DOI":"10.1016\/j.tcs.2011.03.023","volume":"412","author":"B. Klin","year":"2011","unstructured":"Klin, B.: Bialgebras for structural operational semantics: An introduction. TCS\u00a0412(38), 5043\u20135069 (2011)","journal-title":"TCS"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S1571-0661(05)80265-8","volume":"19","author":"M. Lenisa","year":"1999","unstructured":"Lenisa, M.: From set-theoretic coinduction to coalgebraic coinduction: some results, some problems. Elect. Not. in Theor. Comput. Sci.\u00a019, 2\u201322 (1999)","journal-title":"Elect. Not. in Theor. Comput. Sci."},{"key":"1_CR21","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)"},{"issue":"6","key":"1_CR22","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput.\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"14","key":"1_CR23","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1016\/S0140-3664(96)01149-8","volume":"19","author":"J. Parrow","year":"1996","unstructured":"Parrow, J., Sj\u00f6din, P.: Designing a multiway synchronization protocol. Computer Communications\u00a019(14), 1151\u20131160 (1996)","journal-title":"Computer Communications"},{"issue":"2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ic.2006.06.002","volume":"205","author":"A. Rensink","year":"2007","unstructured":"Rensink, A., Vogler, W.: Fair testing. Inf. Comput.\u00a0205(2), 125\u2013198 (2007)","journal-title":"Inf. Comput."},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-35843-2_32","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"J. Rot","year":"2013","unstructured":"Rot, J., Bonsangue, M., Rutten, J.: Coalgebraic bisimulation-up-to. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol.\u00a07741, pp. 369\u2013381. Springer, Heidelberg (2013)"},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. TCS\u00a0249(1), 3\u201380 (2000)","journal-title":"TCS"},{"key":"1_CR27","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D. Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. Math. Struc. in CS\u00a08, 447\u2013479 (1998)","journal-title":"Math. Struc. in CS"},{"key":"1_CR28","unstructured":"Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing the powerset construction, coalgebraically. In: Proc. FSTTCS. LIPIcs, vol.\u00a08, pp. 272\u2013283 (2010)"},{"key":"1_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11591191_28","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Tabakov","year":"2005","unstructured":"Tabakov, D., Vardi, M.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 396\u2013411. Springer, Heidelberg (2005)"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.: The linear time - branching time spectrum I. The semantics of concrete, sequential processes. In: Handbook of Process Algebra, pp. 3\u201399. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50019-9"},{"key":"1_CR31","unstructured":"Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis, Eindhoven University of Technology, the Netherlands (1995)"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11817963_5","volume-title":"Computer Aided Verification","author":"M. De Wulf","year":"2006","unstructured":"De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 17\u201330. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03542-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T21:50:37Z","timestamp":1676843437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03542-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035413","9783319035420"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03542-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}