%0 Book Section
%9 Working Paper
%A Lluch-Lafuente, Alberto
%A Meseguer, José
%A Vandin, Andrea
%B Formal Methods and Software Engineering
%D 2012
%F eprints:1293
%I Springer
%N 7635
%P 430-446
%S Lecture Notes in Computer Science
%T State space c-reductions for concurrent systems in rewriting logic
%U http://eprints.imtlucca.it/1293/
%X We present c-reductions, a simple, flexible and very general state space reduction technique that exploits an equivalence relation on states that is a bisimulation. Reduction is achieved by a canonizer function, which maps each state into a not necessarily unique canonical representative of its equivalence class. The approach contains symmetry reduction and name reuse and name abstraction as special cases, and exploits the expressiveness of rewriting logic and its realization in Maude  to automate c-reductions and to seamlessly integrate model checking and the discharging of correctness proof obligations. The performance of the approach has been validated over a set of representative case studies.
%Z 14th International Conference on Formal Engineering Methods, ICFEM 2012, Kyoto, Japan, November 12-16, 2012. Proceedings