{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:05:36Z","timestamp":1778713536718,"version":"3.51.4"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,2]]},"abstract":"<jats:p> The definition of bisimulation suggests a partition-refinement step, which we show to be suitable for a saturation-based implementation. We compare our fully symbolic saturation-based implementation with the fastest extant bisimulation algorithms over a set of benchmarks, and conclude that it appears to be the fastest algorithm capable of computing the largest bisimulation over very large quotient spaces. <\/jats:p>","DOI":"10.1142\/s012905411340011x","type":"journal-article","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T07:23:44Z","timestamp":1370244224000},"page":"263-282","source":"Crossref","is-referenced-by-count":4,"title":["AN EFFICIENT FULLY SYMBOLIC BISIMULATION ALGORITHM FOR NON-DETERMINISTIC SYSTEMS"],"prefix":"10.1142","volume":"24","author":[{"given":"MALCOLM","family":"MUMME","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of California at Riverside, Riverside, California 92521, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GIANFRANCO","family":"CIARDO","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of California at Riverside, Riverside, California 92521, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,6,3]]},"reference":[{"key":"p_3","first-page":"51","volume":"4218","author":"Chung M.Y.","journal-title":"LNCS"},{"key":"p_5","first-page":"256","volume":"2517","author":"Ciardo G.","year":"2002","journal-title":"LNCS"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90023-2"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00361-X"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211911"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1137\/0216062"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90159-8"},{"key":"p_15","first-page":"582","volume":"5404","author":"Wan M.","journal-title":"LNCS"},{"key":"p_17","first-page":"201","volume":"2010","author":"Zhao Y.","journal-title":"NASA\/CP-"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905411340011X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:57:47Z","timestamp":1565182667000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905411340011X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":9,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2013,6,3]]},"published-print":{"date-parts":[[2013,2]]}},"alternative-id":["10.1142\/S012905411340011X"],"URL":"https:\/\/doi.org\/10.1142\/s012905411340011x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2]]}}}