Rewriting logic is a simple computational logic that can naturally express both concurrent
computation and logical deduction with great generality. This paper provides a gentle …

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 …

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 …

Network Algebra considers the algebraic study of networks and their behaviour. It contains
general results on the algebraic theory of networks, recent results on the algebraic theory of …

Formal semantic definitions of concurrent languages, when specified in a well-suited
semantic framework and supported by generic and efficient formal tools, can be the basis of …

This paper describes in detail how to bridge the gap between theory and practice in a new
implementation of the CCS operational semantics in Maude, where transitions become …

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 …

A quite flourishing research thread in the recent literature on component-based systems is
concerned with the algebraic properties of different classes of connectors. In a recent paper …

Recent years have seen a growing interest towards algebraic structures that are able to
express formalisms different from the standard, tree-like presentation of terms. Many of these …