?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Feprints.imtlucca.it%2F1012%2F&rft.title=State+space+c-reductions+for+concurrent+systems+in+rewriting+logic&rft.creator=Lluch-Lafuente%2C+Alberto&rft.creator=Meseguer%2C+Jos%C3%A9&rft.creator=Vandin%2C+Andrea&rft.subject=QA75+Electronic+computers.+Computer+science&rft.description=We+present+c-reductions%2C+a+state+space+reduction+technique.%0D%0AThe+rough+idea+is+to+exploit+some+equivalence+relation+on+states+(possibly+capturing+system+regularities)+that+preserves+behavioral+properties%2C+and+explore+the+induced+quotient+system.+This+is+done+by+means+of+a+canonizer%0D%0Afunction%2C+which+maps+each+state+into+a+(non+necessarily+unique)+canonical+representative+of+its+equivalence+class.+The+approach+exploits+the+expressiveness+of+rewriting+logic+and+its+realization+in+Maude+to+enjoy+several+advantages+over+similar+approaches%3A+exibility+and+simplicity+in%0D%0Athe+definition+of+the+reductions+(supporting+not+only+traditional+symmetry+reductions%2C+but+also+name+reuse+and+name+abstraction)%3B+reasoning+support+for+checking+and+proving+correctness+of+the+reductions%3B+and+automatization%0D%0Aof+the+reduction+infrastructure+via+Maude's+meta-programming%0D%0Afeatures.+The+approach+has+been+validated+over+a+set+of+representative+case+studies%2C+exhibiting+comparable+results+with+respect+to+other+tools.&rft.date=2011&rft.type=Working+Paper&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Feprints.imtlucca.it%2F1012%2F1%2FLluch-lafuente_Meseguer_Vandin_2011.pdf&rft.identifier=++Lluch-Lafuente%2C+Alberto+and+Meseguer%2C+Jos%C3%A9+and+Vandin%2C+Andrea++State+space+c-reductions+for+concurrent+systems+in+rewriting+logic.++Working+Paper+++++++(Unpublished)+++