Lluch-Lafuente, Alberto and Meseguer, José and Vandin, Andrea State space c-reductions for concurrent systems in rewriting logic. In: Formal Methods and Software Engineering. Lecture Notes in Computer Science (7635). Springer, pp. 430-446. ISBN 978-3-642-34281-3 (2012)
This is the latest version of this item.
- Draft Version
Download (324kB) | Preview
Download (490kB) | Preview
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.
|Item Type:||Book Section|
|Additional Information:||14th International Conference on Formal Engineering Methods, ICFEM 2012, Kyoto, Japan, November 12-16, 2012. Proceedings|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 30 not found.|
|Date Deposited:||29 Jun 2012 12:28|
|Last Modified:||13 Jul 2016 09:49|
Available Versions of this Item
- State space c-reductions for concurrent systems in rewriting logic. (deposited 29 Jun 2012 12:28) [Currently Displayed]
Actions (login required)