The theory and applications of rewriting logic have been vigorously developed by
researchers all over the world during the past eleven years. The attached bibliography …

This chapter describes some existing Maude-based tools that are available for download.
The first section describes tools concerned with analysis of either Maude specifications, or of …

Rewriting logic expresses an essential equivalence between logic and computation. System
states are in bijective correspondence with formulas, and concurrent computations are in …

The dynamics of reactive systems, eg CCS, has often been defined using a labelled
transition system (LTS). More recently it has become natural in defining dynamics to use …

Given the different perspectives from which a complex software system has to be analyzed,
the multiplicity of formalisms is unavoidable. This poses two important technical challenges …

The main feature of zero-safe nets is a primitive notion of transition synchronization. To this
aim, besides ordinary places, called stable places, zero-safe nets are equipped with zero …

Tile systems offer a general paradigm for modular descriptions of concurrent systems, based
on a set of rewriting rules with side-effects. Monoidal double categories are a natural …

A popular graphical calculus for monoidal categories makes computations tactile and
intuitive. Complicated diagram chases can be expressed in a few pictures and discovered …

Rewriting logic extends to concurrent systems with state changes the body of theory
developed within the algebraic semantics approach. It is both a foundational tool and the …

Standard SOS formats are limited in their ability to define the operational semantics of
process calculi with concurrency, causality, and mobility, and with bound names and name …