Initial computability, algebraic specifications, and partial algebras
Initial computability, algebraic specifications, and partial algebras
Information and Computation
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
Information and Computation
An axiomatization of the algebra of Petri net concatenable processes
Theoretical Computer Science
On the Category of Petri Net Computations
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
| Hi-index | 5.23 |
We modify the definition of the models for rewrite theories by replacing the equality of functors, defined by E-equal terms, with the equality via a natural isomorphism, called natural symmetry. The relaxation process can be adapted by relaxing all or only a part of the equations, and by relaxing the state structure (and implicitly the computation structure) or just the computation structure. We also consider the subclasses of C-coherent models, where C is a set of equations specifying a collection of commutative symmetry diagrams. The result is a wide palette of model classes which offers more flexibility in modeling concurrent systems.