TY  - CHAP
T3  - Lecture Notes in Computer Science
SP  - 430
N2  - 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.
ID  - eprints1293
AV  - public
SN  - 978-3-642-34281-3
EP  - 446
N1  - 14th International Conference on Formal Engineering Methods, ICFEM 2012, Kyoto, Japan, November 12-16, 2012. Proceedings
TI  - State space c-reductions for concurrent systems in rewriting logic
PB  - Springer
UR  - http://dx.doi.org/10.1007/978-3-642-34281-3_30
A1  - Lluch-Lafuente, Alberto
A1  - Meseguer, José
A1  - Vandin, Andrea
T2  - Formal Methods and Software Engineering
Y1  - 2012///
ER  -