Relaxed models for rewriting logic
type: Item
instance of: scholarly article
title: Relaxed models for rewriting logic
zbMATH Open document ID: 1018.68036
DOI: 10.1016/S0304-3975(01)00331-0
author: Dorel Lucanu
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1857115
zbMATH Keywords: rewriting logic
zbMATH Keywords: relaxed models
zbMATH Keywords: categories with algebraic structure
describes a project that uses: CafeOBJ
MaRDI profile type: Publication
cites work: CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
cites work: Q4934346
cites work: Q5639839
cites work: Conditional rewriting logic as a unified model of concurrency
cites work: Petri nets are monoids
cites work: Proving semantical equivalence of data specifications
cites work: Why tricategories?
cites work: Q3773301
cites work: On the category of Petri net computations
cites work: An axiomatization of the algebra of Petri net concatenable processes
description: scientific article; zbMATH DE number 1857115