Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Communication and concurrency
A completion procedure for conditional equationst
Journal of Symbolic Computation
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Handbook of logic in artificial intelligence and logic programming
Rewriting: An Effective Model of Concurrency
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Rewriting modulo a rewrite system
Rewriting modulo a rewrite system
A Rewriting Implementation of pi-calculus
A Rewriting Implementation of pi-calculus
| Hi-index | 0.00 |
This paper introduces a generic and uniform approach to integrate different design languages for distributed systems in verification tools. It is based on Meseguer's Rewriting Logic, hence transitions between the states of the respective system are modeled as (conditional) term rewriting steps modulo an equational theory. We argue that, for reasons of efficiency, it is intractable to admit arbitrary equations, and propose to employ rewriting modulo associativity and commutativity instead, using oriented versions of the equations. Furthermore the question is raised under which conditions this implementational restriction is complete. To this aim we define a coherence property which guarantees that every transition which is possible in the (fully equational) semantics can also be computed using the oriented equations, and we show that this property can be verified by testing the joinability of finitely many conditional critical pairs between transition rules and oriented equations.