State space c-reductions for concurrent systems in rewriting logic

Lluch-Lafuente, Alberto and Vandin, Andrea and Meseguer, José State space c-reductions for concurrent systems in rewriting logic. Working Paper (Unpublished)

Preview	PDF - Updated Version Download (324kB) | Preview
Preview	PDF Download (490kB) | Preview
Preview	PDF Download (492kB) | Preview

Abstract

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:	Working Paper (Working Paper)
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area:	Computer Science and Applications
Depositing User:	Users 30 not found.
Date Deposited:	16 Jul 2012 10:16
Last Modified:	13 Jul 2016 10:52
URI:	http://eprints.imtlucca.it/id/eprint/1318

Available Versions of this Item

• State space c-reductions for concurrent systems in rewriting logic. (deposited 22 Nov 2011 10:50)
  • State space c-reductions for concurrent systems in rewriting logic. (deposited 10 Jul 2012 07:10)
    • State space c-reductions for concurrent systems in rewriting logic. (deposited 10 Jul 2012 07:11)
      • State space c-reductions for concurrent systems in rewriting logic. (deposited 16 Jul 2012 10:16) [Currently Displayed]
        • State space c-reductions for concurrent systems in rewriting logic. (deposited 14 Sep 2012 15:24)

Actions (login required)

Edit Item