Logo eprints

State space c-reductions for concurrent systems in rewriting logic

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

WarningThere is a more recent version of this item available.
PDF - Draft Version
Download (324kB) | Preview


We present c-reductions, a state space reduction technique. The rough idea is to exploit some equivalence relation on states (possibly capturing system regularities) that preserves behavioral properties, and explore the induced quotient system. This is done by means of a canonizer function, 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: exibility and simplicity in the definition of the reductions (supporting not only traditional symmetry reductions, but also name reuse and name abstraction); reasoning support for checking and proving correctness of the reductions; and automatization of the reduction infrastructure via Maude's meta-programming features. The approach has been validated over a set of representative case studies, exhibiting comparable results with respect to other tools.

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: 22 Nov 2011 10:50
Last Modified: 13 Jul 2016 10:50
URI: http://eprints.imtlucca.it/id/eprint/1012

Available Versions of this Item

Actions (login required)

Edit Item Edit Item